/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-tiling/mbpr5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:56:25,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:56:25,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 06:56:25,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:56:25,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:56:25,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:56:25,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:56:25,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:56:25,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:56:25,534 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:56:25,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:56:25,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:56:25,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:56:25,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:56:25,536 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:56:25,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:56:25,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:56:25,536 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:56:25,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:56:25,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:56:25,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:56:25,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:56:25,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:56:25,537 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:56:25,538 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:56:25,538 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:56:25,538 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:56:25,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:56:25,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:56:25,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:56:25,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:56:25,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:56:25,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:56:25,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:56:25,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:56:25,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:56:25,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:56:25,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:56:25,541 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:56:25,541 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 06:56:25,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:56:25,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:56:25,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:56:25,786 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:56:25,786 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:56:25,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr5.c [2023-12-16 06:56:26,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:56:27,043 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:56:27,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr5.c [2023-12-16 06:56:27,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f75e481/4e823b01916041fca2c2ad5bc1d41480/FLAGa3853abb7 [2023-12-16 06:56:27,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f75e481/4e823b01916041fca2c2ad5bc1d41480 [2023-12-16 06:56:27,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:56:27,070 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:56:27,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:56:27,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:56:27,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:56:27,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500c55ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27, skipping insertion in model container [2023-12-16 06:56:27,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:56:27,221 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr5.c[396,409] [2023-12-16 06:56:27,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:56:27,270 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:56:27,278 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr5.c[396,409] [2023-12-16 06:56:27,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:56:27,308 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:56:27,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27 WrapperNode [2023-12-16 06:56:27,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:56:27,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:56:27,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:56:27,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:56:27,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,341 INFO L138 Inliner]: procedures = 17, calls = 72, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2023-12-16 06:56:27,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:56:27,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:56:27,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:56:27,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:56:27,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,365 INFO L175 MemorySlicer]: Split 62 memory accesses to 3 slices as follows [2, 8, 52]. 84 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 30 writes are split as follows [0, 0, 30]. [2023-12-16 06:56:27,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:56:27,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:56:27,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:56:27,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:56:27,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (1/1) ... [2023-12-16 06:56:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:56:27,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:56:27,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 06:56:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:56:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:56:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:56:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 06:56:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 06:56:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:56:27,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 06:56:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 06:56:27,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 06:56:27,532 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:56:27,533 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:56:27,960 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:56:27,989 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:56:27,990 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-16 06:56:27,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:56:27 BoogieIcfgContainer [2023-12-16 06:56:27,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:56:27,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:56:27,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:56:27,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:56:27,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:56:27" (1/3) ... [2023-12-16 06:56:27,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1664c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:56:27, skipping insertion in model container [2023-12-16 06:56:27,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:56:27" (2/3) ... [2023-12-16 06:56:27,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1664c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:56:27, skipping insertion in model container [2023-12-16 06:56:27,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:56:27" (3/3) ... [2023-12-16 06:56:27,996 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2023-12-16 06:56:28,008 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:56:28,008 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:56:28,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:56:28,054 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64a84cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:56:28,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:56:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 06:56:28,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:56:28,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:56:28,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:56:28,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:56:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash -102978815, now seen corresponding path program 1 times [2023-12-16 06:56:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:56:28,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818639272] [2023-12-16 06:56:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:56:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:56:28,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:56:28,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 06:56:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:56:28,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 06:56:28,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:56:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:56:28,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:56:28,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:56:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818639272] [2023-12-16 06:56:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818639272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:56:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:56:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:56:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351308288] [2023-12-16 06:56:28,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:56:28,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 06:56:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:56:28,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 06:56:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:56:28,212 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:56:28,247 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2023-12-16 06:56:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 06:56:28,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 06:56:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:56:28,282 INFO L225 Difference]: With dead ends: 68 [2023-12-16 06:56:28,282 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 06:56:28,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:56:28,287 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:56:28,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:56:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 06:56:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 06:56:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-12-16 06:56:28,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 20 [2023-12-16 06:56:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:56:28,312 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-12-16 06:56:28,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-12-16 06:56:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 06:56:28,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:56:28,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:56:28,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 06:56:28,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:28,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:56:28,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:56:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1220933681, now seen corresponding path program 1 times [2023-12-16 06:56:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:56:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932251110] [2023-12-16 06:56:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:56:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:56:28,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:56:28,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 06:56:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:56:28,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 06:56:28,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:56:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:56:29,004 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:56:29,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:56:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932251110] [2023-12-16 06:56:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932251110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:56:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:56:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 06:56:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020883701] [2023-12-16 06:56:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:56:29,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:56:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:56:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:56:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:56:29,006 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:56:29,970 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2023-12-16 06:56:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:56:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 06:56:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:56:29,984 INFO L225 Difference]: With dead ends: 71 [2023-12-16 06:56:29,984 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 06:56:29,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:56:29,985 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 93 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 06:56:29,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 20 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 06:56:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 06:56:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-12-16 06:56:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-12-16 06:56:29,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 20 [2023-12-16 06:56:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:56:29,991 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-12-16 06:56:29,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-12-16 06:56:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 06:56:29,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:56:29,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:56:29,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 06:56:30,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:30,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:56:30,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:56:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1944281605, now seen corresponding path program 1 times [2023-12-16 06:56:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:56:30,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795192252] [2023-12-16 06:56:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:56:30,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:30,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:56:30,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:56:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 06:56:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:56:30,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:56:30,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:56:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 06:56:30,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:56:30,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:56:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795192252] [2023-12-16 06:56:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795192252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:56:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:56:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:56:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099438376] [2023-12-16 06:56:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:56:30,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:56:30,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:56:30,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:56:30,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:56:30,459 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:56:30,502 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-16 06:56:30,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:56:30,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-16 06:56:30,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:56:30,503 INFO L225 Difference]: With dead ends: 48 [2023-12-16 06:56:30,503 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 06:56:30,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:56:30,505 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:56:30,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:56:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 06:56:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-16 06:56:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-12-16 06:56:30,510 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 35 [2023-12-16 06:56:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:56:30,510 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-12-16 06:56:30,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-12-16 06:56:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 06:56:30,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:56:30,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:56:30,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 06:56:30,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:30,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:56:30,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:56:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1670627321, now seen corresponding path program 1 times [2023-12-16 06:56:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:56:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680597467] [2023-12-16 06:56:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:56:30,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:30,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:56:30,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:56:30,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 06:56:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:56:30,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 06:56:30,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:56:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 06:56:30,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:56:30,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:56:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680597467] [2023-12-16 06:56:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680597467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:56:30,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:56:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:56:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130864531] [2023-12-16 06:56:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:56:30,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 06:56:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:56:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 06:56:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 06:56:30,841 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:56:30,883 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-16 06:56:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 06:56:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-16 06:56:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:56:30,884 INFO L225 Difference]: With dead ends: 42 [2023-12-16 06:56:30,884 INFO L226 Difference]: Without dead ends: 40 [2023-12-16 06:56:30,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:56:30,885 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:56:30,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:56:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-16 06:56:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-12-16 06:56:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2023-12-16 06:56:30,890 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 35 [2023-12-16 06:56:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:56:30,890 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2023-12-16 06:56:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2023-12-16 06:56:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 06:56:30,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:56:30,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:56:30,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 06:56:31,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:31,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:56:31,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:56:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1670567739, now seen corresponding path program 1 times [2023-12-16 06:56:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:56:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177077002] [2023-12-16 06:56:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:56:31,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:31,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:56:31,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:56:31,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 06:56:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:56:31,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 06:56:31,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:56:31,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 06:56:31,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:31,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2023-12-16 06:56:31,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 06:56:31,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:31,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 18 [2023-12-16 06:56:31,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 06:56:31,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 11 [2023-12-16 06:56:31,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 06:56:31,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:31,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 32 [2023-12-16 06:56:31,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-16 06:56:31,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:31,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 42 [2023-12-16 06:56:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:56:31,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:56:51,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-16 06:56:51,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2023-12-16 06:56:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:56:51,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:56:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177077002] [2023-12-16 06:56:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177077002] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:56:51,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:56:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2023-12-16 06:56:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397300528] [2023-12-16 06:56:51,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:56:51,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 06:56:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:56:51,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 06:56:51,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=292, Unknown=1, NotChecked=0, Total=380 [2023-12-16 06:56:51,373 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:56:54,226 INFO L93 Difference]: Finished difference Result 211 states and 273 transitions. [2023-12-16 06:56:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 06:56:54,227 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-16 06:56:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:56:54,229 INFO L225 Difference]: With dead ends: 211 [2023-12-16 06:56:54,229 INFO L226 Difference]: Without dead ends: 178 [2023-12-16 06:56:54,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=399, Invalid=1082, Unknown=1, NotChecked=0, Total=1482 [2023-12-16 06:56:54,231 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 484 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:56:54,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 130 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 06:56:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-16 06:56:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 75. [2023-12-16 06:56:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2023-12-16 06:56:54,244 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 35 [2023-12-16 06:56:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:56:54,245 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2023-12-16 06:56:54,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:56:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2023-12-16 06:56:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 06:56:54,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:56:54,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:56:54,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 06:56:54,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:54,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:56:54,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:56:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1182774831, now seen corresponding path program 1 times [2023-12-16 06:56:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:56:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188710322] [2023-12-16 06:56:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:56:54,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:56:54,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:56:54,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:56:54,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 06:56:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:56:54,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 06:56:54,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:56:54,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 06:56:54,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:54,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2023-12-16 06:56:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 06:56:54,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 11 [2023-12-16 06:56:54,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 06:56:54,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:54,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 32 [2023-12-16 06:56:54,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-16 06:56:54,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:56:54,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 42 [2023-12-16 06:56:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 06:56:55,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:57:12,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-12-16 06:57:12,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:12,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2626 treesize of output 2172 [2023-12-16 06:57:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 06:57:13,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:57:13,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188710322] [2023-12-16 06:57:13,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188710322] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:57:13,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:57:13,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2023-12-16 06:57:13,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50840544] [2023-12-16 06:57:13,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:57:13,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 06:57:13,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:57:13,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 06:57:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=297, Unknown=2, NotChecked=0, Total=380 [2023-12-16 06:57:13,177 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:57:15,753 INFO L93 Difference]: Finished difference Result 224 states and 289 transitions. [2023-12-16 06:57:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 06:57:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-16 06:57:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:57:15,756 INFO L225 Difference]: With dead ends: 224 [2023-12-16 06:57:15,756 INFO L226 Difference]: Without dead ends: 161 [2023-12-16 06:57:15,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=430, Invalid=1290, Unknown=2, NotChecked=0, Total=1722 [2023-12-16 06:57:15,757 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 373 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 06:57:15,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 149 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 06:57:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-16 06:57:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 71. [2023-12-16 06:57:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2023-12-16 06:57:15,767 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 40 [2023-12-16 06:57:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:57:15,768 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2023-12-16 06:57:15,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2023-12-16 06:57:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 06:57:15,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:57:15,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:57:15,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 06:57:15,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:57:15,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:57:15,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:57:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 634045189, now seen corresponding path program 2 times [2023-12-16 06:57:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:57:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549749599] [2023-12-16 06:57:15,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:57:15,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:57:15,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:57:15,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:57:15,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 06:57:16,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:57:16,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:57:16,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 06:57:16,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:57:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 06:57:17,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:57:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 06:57:18,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:57:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549749599] [2023-12-16 06:57:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549749599] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:57:18,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:57:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-16 06:57:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415530607] [2023-12-16 06:57:18,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:57:18,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 06:57:18,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:57:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 06:57:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-16 06:57:18,478 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:57:21,630 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2023-12-16 06:57:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 06:57:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-16 06:57:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:57:21,637 INFO L225 Difference]: With dead ends: 214 [2023-12-16 06:57:21,637 INFO L226 Difference]: Without dead ends: 154 [2023-12-16 06:57:21,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:57:21,638 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 177 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:57:21,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 75 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 06:57:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-16 06:57:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2023-12-16 06:57:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2023-12-16 06:57:21,653 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 41 [2023-12-16 06:57:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:57:21,653 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2023-12-16 06:57:21,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2023-12-16 06:57:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 06:57:21,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:57:21,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:57:21,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 06:57:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:57:21,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:57:21,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:57:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 884207685, now seen corresponding path program 2 times [2023-12-16 06:57:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:57:21,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868576353] [2023-12-16 06:57:21,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:57:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:57:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:57:21,861 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:57:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 06:57:22,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:57:22,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:57:22,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 06:57:22,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:57:22,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 06:57:22,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2023-12-16 06:57:22,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 06:57:22,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:22,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 32 [2023-12-16 06:57:22,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-16 06:57:22,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:22,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 42 [2023-12-16 06:57:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:57:22,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:57:22,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2023-12-16 06:57:22,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8754 treesize of output 8690 [2023-12-16 06:57:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:57:23,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:57:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868576353] [2023-12-16 06:57:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868576353] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:57:23,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:57:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2023-12-16 06:57:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85804690] [2023-12-16 06:57:23,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:57:23,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 06:57:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:57:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 06:57:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:57:23,023 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:27,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 06:57:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:57:29,098 INFO L93 Difference]: Finished difference Result 267 states and 323 transitions. [2023-12-16 06:57:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-16 06:57:29,099 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-12-16 06:57:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:57:29,100 INFO L225 Difference]: With dead ends: 267 [2023-12-16 06:57:29,100 INFO L226 Difference]: Without dead ends: 193 [2023-12-16 06:57:29,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=451, Invalid=1711, Unknown=0, NotChecked=0, Total=2162 [2023-12-16 06:57:29,101 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 314 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 91 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:57:29,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 171 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2023-12-16 06:57:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-16 06:57:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 121. [2023-12-16 06:57:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.225) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2023-12-16 06:57:29,120 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 45 [2023-12-16 06:57:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:57:29,120 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2023-12-16 06:57:29,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2023-12-16 06:57:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 06:57:29,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:57:29,121 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:57:29,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 06:57:29,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:57:29,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:57:29,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:57:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash -875941295, now seen corresponding path program 3 times [2023-12-16 06:57:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:57:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607651940] [2023-12-16 06:57:29,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:57:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:57:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:57:29,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:57:29,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 06:57:29,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 06:57:29,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:57:29,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-16 06:57:29,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:57:29,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 06:57:29,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:29,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2023-12-16 06:57:29,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-16 06:57:29,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:29,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2023-12-16 06:57:29,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:29,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-16 06:57:29,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:29,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 31 [2023-12-16 06:57:30,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:30,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-16 06:57:30,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:30,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 48 [2023-12-16 06:57:30,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:30,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2023-12-16 06:57:30,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:57:30,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 51 [2023-12-16 06:57:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:57:30,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:57:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 06:57:31,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:57:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607651940] [2023-12-16 06:57:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607651940] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:57:31,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:57:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 26 [2023-12-16 06:57:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995555044] [2023-12-16 06:57:31,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:57:31,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 06:57:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:57:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 06:57:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2023-12-16 06:57:31,243 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:57:36,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 06:57:41,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-16 06:57:41,775 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:57:41,795 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:57:42,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 06:57:42,996 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 06:57:43,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2023-12-16 06:57:43,025 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 231 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:57:43,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 136 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 600 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2023-12-16 06:57:43,026 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 06:57:43,026 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-16 06:57:43,029 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-12-16 06:57:43,031 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:57:43,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 06:57:43,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:57:43 BoogieIcfgContainer [2023-12-16 06:57:43,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:57:43,051 INFO L158 Benchmark]: Toolchain (without parser) took 75980.69ms. Allocated memory is still 228.6MB. Free memory was 174.7MB in the beginning and 63.0MB in the end (delta: 111.7MB). Peak memory consumption was 113.0MB. Max. memory is 8.0GB. [2023-12-16 06:57:43,051 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 189.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:57:43,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.12ms. Allocated memory is still 228.6MB. Free memory was 174.2MB in the beginning and 160.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 06:57:43,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.35ms. Allocated memory is still 228.6MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 06:57:43,052 INFO L158 Benchmark]: Boogie Preprocessor took 44.41ms. Allocated memory is still 228.6MB. Free memory was 157.9MB in the beginning and 154.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 06:57:43,052 INFO L158 Benchmark]: RCFGBuilder took 603.20ms. Allocated memory is still 228.6MB. Free memory was 154.8MB in the beginning and 129.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-16 06:57:43,052 INFO L158 Benchmark]: TraceAbstraction took 75058.93ms. Allocated memory is still 228.6MB. Free memory was 128.6MB in the beginning and 63.0MB in the end (delta: 65.5MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2023-12-16 06:57:43,053 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 189.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.12ms. Allocated memory is still 228.6MB. Free memory was 174.2MB in the beginning and 160.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.35ms. Allocated memory is still 228.6MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.41ms. Allocated memory is still 228.6MB. Free memory was 157.9MB in the beginning and 154.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 603.20ms. Allocated memory is still 228.6MB. Free memory was 154.8MB in the beginning and 129.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 75058.93ms. Allocated memory is still 228.6MB. Free memory was 128.6MB in the beginning and 63.0MB in the end (delta: 65.5MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1691 SdHoareTripleChecker+Valid, 22.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1691 mSDsluCounter, 843 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 648 mSDsCounter, 544 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2531 IncrementalHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 544 mSolverCounterUnsat, 195 mSDtfsCounter, 2531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 414 SyntacticMatches, 10 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 43.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=8, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 325 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 44.3s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 518 ConstructedInterpolants, 18 QuantifiedInterpolants, 5819 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1024 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 71/170 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown