/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/reducercommutativity/rangesum05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 17:23:46,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 17:23:46,632 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-21 17:23:46,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 17:23:46,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 17:23:46,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 17:23:46,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 17:23:46,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 17:23:46,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 17:23:46,656 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 17:23:46,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 17:23:46,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 17:23:46,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 17:23:46,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 17:23:46,658 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 17:23:46,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 17:23:46,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 17:23:46,659 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 17:23:46,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 17:23:46,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 17:23:46,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 17:23:46,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 17:23:46,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 17:23:46,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 17:23:46,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 17:23:46,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 17:23:46,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 17:23:46,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 17:23:46,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 17:23:46,663 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 17:23:46,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 17:23:46,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 17:23:46,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 17:23:46,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 17:23:46,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:23:46,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 17:23:46,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 17:23:46,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 17:23:46,666 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 17:23:46,666 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 17:23:46,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 17:23:46,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 17:23:46,667 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 17:23:46,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 17:23:46,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 17:23:46,668 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 17:23:46,668 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-21 17:23:46,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 17:23:46,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 17:23:46,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 17:23:46,913 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 17:23:46,913 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 17:23:46,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i [2023-12-21 17:23:48,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 17:23:48,281 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 17:23:48,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i [2023-12-21 17:23:48,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61598f52d/2e9cf710355641089411ad6d85f12ed3/FLAG712cc44ae [2023-12-21 17:23:48,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61598f52d/2e9cf710355641089411ad6d85f12ed3 [2023-12-21 17:23:48,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 17:23:48,300 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 17:23:48,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 17:23:48,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 17:23:48,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 17:23:48,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1637da5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48, skipping insertion in model container [2023-12-21 17:23:48,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 17:23:48,542 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i[1457,1470] [2023-12-21 17:23:48,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:23:48,559 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 17:23:48,595 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i[1457,1470] [2023-12-21 17:23:48,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:23:48,609 INFO L206 MainTranslator]: Completed translation [2023-12-21 17:23:48,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48 WrapperNode [2023-12-21 17:23:48,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 17:23:48,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 17:23:48,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 17:23:48,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 17:23:48,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,641 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-12-21 17:23:48,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 17:23:48,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 17:23:48,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 17:23:48,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 17:23:48,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,665 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-21 17:23:48,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 17:23:48,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 17:23:48,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 17:23:48,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 17:23:48,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (1/1) ... [2023-12-21 17:23:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:23:48,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 17:23:48,721 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-21 17:23:48,752 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-21 17:23:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 17:23:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 17:23:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 17:23:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 17:23:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 17:23:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 17:23:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 17:23:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 17:23:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-12-21 17:23:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-12-21 17:23:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 17:23:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 17:23:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 17:23:48,834 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 17:23:48,836 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 17:23:49,315 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 17:23:49,344 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 17:23:49,344 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 17:23:49,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:23:49 BoogieIcfgContainer [2023-12-21 17:23:49,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 17:23:49,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 17:23:49,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 17:23:49,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 17:23:49,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:23:48" (1/3) ... [2023-12-21 17:23:49,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6ef796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:23:49, skipping insertion in model container [2023-12-21 17:23:49,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:48" (2/3) ... [2023-12-21 17:23:49,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6ef796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:23:49, skipping insertion in model container [2023-12-21 17:23:49,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:23:49" (3/3) ... [2023-12-21 17:23:49,353 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2023-12-21 17:23:49,369 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 17:23:49,370 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 17:23:49,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 17:23:49,415 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;@7a0af6cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 17:23:49,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 17:23:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 17:23:49,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:49,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:49,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:49,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2023-12-21 17:23:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092492610] [2023-12-21 17:23:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:49,445 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-21 17:23:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:49,452 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-21 17:23:49,456 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-21 17:23:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:49,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 17:23:49,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 17:23:49,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:23:49,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092492610] [2023-12-21 17:23:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092492610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:23:49,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:23:49,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:23:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074184994] [2023-12-21 17:23:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:23:49,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 17:23:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 17:23:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 17:23:49,977 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 17:23:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:50,051 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2023-12-21 17:23:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 17:23:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-12-21 17:23:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:50,059 INFO L225 Difference]: With dead ends: 44 [2023-12-21 17:23:50,059 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 17:23:50,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-21 17:23:50,066 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:50,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:23:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 17:23:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 17:23:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-12-21 17:23:50,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 28 [2023-12-21 17:23:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:50,104 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-12-21 17:23:50,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 17:23:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-12-21 17:23:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 17:23:50,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:50,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:50,129 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 (2)] Forceful destruction successful, exit code 0 [2023-12-21 17:23:50,329 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-21 17:23:50,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:50,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1260265879, now seen corresponding path program 1 times [2023-12-21 17:23:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386226629] [2023-12-21 17:23:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:50,331 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-21 17:23:50,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:50,333 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-21 17:23:50,334 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-21 17:23:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:50,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:23:50,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 17:23:50,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:23:50,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386226629] [2023-12-21 17:23:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386226629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:23:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:23:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:23:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382879296] [2023-12-21 17:23:50,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:23:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:23:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:23:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:23:50,670 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:23:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:50,707 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-21 17:23:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:23:50,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-12-21 17:23:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:50,709 INFO L225 Difference]: With dead ends: 41 [2023-12-21 17:23:50,709 INFO L226 Difference]: Without dead ends: 22 [2023-12-21 17:23:50,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-21 17:23:50,711 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:50,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:23:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-21 17:23:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-21 17:23:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-21 17:23:50,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2023-12-21 17:23:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:50,726 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-21 17:23:50,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:23:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-21 17:23:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 17:23:50,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:50,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:50,749 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-21 17:23:50,946 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-21 17:23:50,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:50,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2023-12-21 17:23:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610234012] [2023-12-21 17:23:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:50,948 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-21 17:23:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:50,950 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-21 17:23:50,951 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-21 17:23:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:51,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:23:51,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 17:23:51,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:23:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 17:23:51,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610234012] [2023-12-21 17:23:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610234012] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:23:51,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:23:51,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-21 17:23:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443514224] [2023-12-21 17:23:51,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:23:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:23:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:23:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:23:51,324 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:23:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:51,388 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-12-21 17:23:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:23:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 29 [2023-12-21 17:23:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:51,390 INFO L225 Difference]: With dead ends: 44 [2023-12-21 17:23:51,390 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 17:23:51,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:23:51,391 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:51,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:23:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 17:23:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 17:23:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-21 17:23:51,396 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2023-12-21 17:23:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:51,397 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-21 17:23:51,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:23:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-21 17:23:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 17:23:51,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:51,398 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:51,414 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 (4)] Forceful destruction successful, exit code 0 [2023-12-21 17:23:51,608 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-21 17:23:51,609 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:51,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1860680425, now seen corresponding path program 2 times [2023-12-21 17:23:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206290276] [2023-12-21 17:23:51,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:23:51,610 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-21 17:23:51,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:51,612 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-21 17:23:51,615 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-21 17:23:51,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:23:51,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:23:51,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:23:51,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 17:23:51,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:23:51,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206290276] [2023-12-21 17:23:51,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206290276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:23:51,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:23:51,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:23:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104911231] [2023-12-21 17:23:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:23:51,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:23:51,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:23:51,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:23:51,795 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:23:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:51,855 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-21 17:23:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:23:51,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-12-21 17:23:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:51,859 INFO L225 Difference]: With dead ends: 45 [2023-12-21 17:23:51,859 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 17:23:51,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-21 17:23:51,860 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:51,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:23:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 17:23:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-21 17:23:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-21 17:23:51,866 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2023-12-21 17:23:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:51,866 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-21 17:23:51,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:23:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-21 17:23:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-21 17:23:51,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:51,867 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:51,881 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-21 17:23:52,074 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-21 17:23:52,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:52,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1838186572, now seen corresponding path program 1 times [2023-12-21 17:23:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910669559] [2023-12-21 17:23:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:52,076 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-21 17:23:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:52,077 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-21 17:23:52,111 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-21 17:23:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:52,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:23:52,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:23:52,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:23:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:23:52,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:52,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910669559] [2023-12-21 17:23:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910669559] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:23:52,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:23:52,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-21 17:23:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469972334] [2023-12-21 17:23:52,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:23:52,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:23:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:23:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:23:52,604 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:23:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:52,719 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-12-21 17:23:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 17:23:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2023-12-21 17:23:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:52,721 INFO L225 Difference]: With dead ends: 49 [2023-12-21 17:23:52,721 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 17:23:52,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:23:52,722 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:52,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:23:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 17:23:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-21 17:23:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-21 17:23:52,728 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 41 [2023-12-21 17:23:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:52,728 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-21 17:23:52,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 17:23:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-21 17:23:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 17:23:52,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:52,729 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:52,755 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-21 17:23:52,952 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-21 17:23:52,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:52,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1250531518, now seen corresponding path program 2 times [2023-12-21 17:23:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629770734] [2023-12-21 17:23:52,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:23:52,954 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-21 17:23:52,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:52,955 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-21 17:23:52,956 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-21 17:23:53,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:23:53,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:23:53,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:23:53,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 17:23:53,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:23:53,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629770734] [2023-12-21 17:23:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629770734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:23:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:23:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:23:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580820639] [2023-12-21 17:23:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:23:53,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:23:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:23:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:23:53,114 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:23:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:53,288 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2023-12-21 17:23:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:23:53,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2023-12-21 17:23:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:53,296 INFO L225 Difference]: With dead ends: 53 [2023-12-21 17:23:53,296 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 17:23:53,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-21 17:23:53,297 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:53,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:23:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 17:23:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-12-21 17:23:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-21 17:23:53,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2023-12-21 17:23:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:53,305 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-21 17:23:53,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 17:23:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-21 17:23:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 17:23:53,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:53,306 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:53,313 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-21 17:23:53,512 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-21 17:23:53,514 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:53,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1821256031, now seen corresponding path program 1 times [2023-12-21 17:23:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783467332] [2023-12-21 17:23:53,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:53,516 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-21 17:23:53,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:53,521 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-21 17:23:53,522 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-21 17:23:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:53,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:23:53,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:23:53,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:23:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-21 17:23:53,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783467332] [2023-12-21 17:23:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783467332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:23:53,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:23:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 17:23:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907621318] [2023-12-21 17:23:53,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:23:53,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:23:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:23:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:23:53,701 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:23:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:53,815 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2023-12-21 17:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:23:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2023-12-21 17:23:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:53,819 INFO L225 Difference]: With dead ends: 62 [2023-12-21 17:23:53,819 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 17:23:53,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:23:53,820 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:53,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:23:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 17:23:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-12-21 17:23:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-12-21 17:23:53,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 42 [2023-12-21 17:23:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:53,830 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-12-21 17:23:53,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:23:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-12-21 17:23:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-21 17:23:53,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:53,832 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:53,837 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-21 17:23:54,037 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-21 17:23:54,037 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:54,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -187842405, now seen corresponding path program 1 times [2023-12-21 17:23:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106744120] [2023-12-21 17:23:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:54,038 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-21 17:23:54,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:54,045 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-21 17:23:54,051 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-21 17:23:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:54,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 17:23:54,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-12-21 17:23:54,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:23:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 13 proven. 127 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 17:23:54,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106744120] [2023-12-21 17:23:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106744120] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:23:54,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:23:54,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-21 17:23:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207760088] [2023-12-21 17:23:54,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:23:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 17:23:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:54,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 17:23:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 17:23:54,522 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:23:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:54,630 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2023-12-21 17:23:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:23:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2023-12-21 17:23:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:54,635 INFO L225 Difference]: With dead ends: 64 [2023-12-21 17:23:54,636 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 17:23:54,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 17:23:54,637 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:54,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:23:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 17:23:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2023-12-21 17:23:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-12-21 17:23:54,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 69 [2023-12-21 17:23:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:54,649 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-12-21 17:23:54,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:23:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-12-21 17:23:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-21 17:23:54,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:54,650 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:54,670 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 (9)] Ended with exit code 0 [2023-12-21 17:23:54,864 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-21 17:23:54,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:54,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1536276505, now seen corresponding path program 2 times [2023-12-21 17:23:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759618382] [2023-12-21 17:23:54,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:23:54,866 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-21 17:23:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:54,867 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-21 17:23:54,867 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-21 17:23:55,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:23:55,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:23:55,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:23:55,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-21 17:23:55,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:23:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-12-21 17:23:55,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:55,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759618382] [2023-12-21 17:23:55,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759618382] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:23:55,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:23:55,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-21 17:23:55,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433936238] [2023-12-21 17:23:55,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:23:55,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:23:55,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:23:55,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:23:55,490 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:23:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:55,689 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-12-21 17:23:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 17:23:55,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2023-12-21 17:23:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:55,691 INFO L225 Difference]: With dead ends: 71 [2023-12-21 17:23:55,691 INFO L226 Difference]: Without dead ends: 44 [2023-12-21 17:23:55,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-21 17:23:55,692 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:55,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:23:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-21 17:23:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-21 17:23:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-21 17:23:55,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 69 [2023-12-21 17:23:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:55,701 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-21 17:23:55,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 17:23:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-21 17:23:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 17:23:55,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:55,702 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:55,724 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-21 17:23:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-21 17:23:55,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:55,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1928644418, now seen corresponding path program 3 times [2023-12-21 17:23:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703228881] [2023-12-21 17:23:55,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:23:55,921 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-21 17:23:55,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:55,923 INFO L229 MonitoredProcess]: Starting monitored process 11 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-21 17:23:55,929 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 (11)] Waiting until timeout for monitored process [2023-12-21 17:23:56,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 17:23:56,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:23:56,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:23:56,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-21 17:23:56,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:23:56,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703228881] [2023-12-21 17:23:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703228881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:23:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:23:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:23:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070981621] [2023-12-21 17:23:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:23:56,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:23:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:23:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:23:56,207 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 17:23:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:56,235 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-12-21 17:23:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:23:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 78 [2023-12-21 17:23:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:56,237 INFO L225 Difference]: With dead ends: 74 [2023-12-21 17:23:56,237 INFO L226 Difference]: Without dead ends: 44 [2023-12-21 17:23:56,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-21 17:23:56,238 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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-21 17:23:56,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:23:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-21 17:23:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-21 17:23:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-12-21 17:23:56,244 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 78 [2023-12-21 17:23:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:56,245 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-12-21 17:23:56,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 17:23:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-12-21 17:23:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-21 17:23:56,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:56,246 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:56,258 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 (11)] Forceful destruction successful, exit code 0 [2023-12-21 17:23:56,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-21 17:23:56,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:56,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1657469393, now seen corresponding path program 1 times [2023-12-21 17:23:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873098914] [2023-12-21 17:23:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:23:56,457 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-21 17:23:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:56,458 INFO L229 MonitoredProcess]: Starting monitored process 12 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-21 17:23:56,459 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 (12)] Waiting until timeout for monitored process [2023-12-21 17:23:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:23:56,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:23:56,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:23:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-21 17:23:56,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:23:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2023-12-21 17:23:56,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:23:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873098914] [2023-12-21 17:23:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873098914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:23:56,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:23:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 17:23:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397387680] [2023-12-21 17:23:56,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:23:56,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:23:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:23:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:23:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:23:56,898 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:23:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:23:56,967 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2023-12-21 17:23:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:23:56,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 79 [2023-12-21 17:23:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:23:56,969 INFO L225 Difference]: With dead ends: 77 [2023-12-21 17:23:56,969 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 17:23:56,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:23:56,970 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:23:56,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:23:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 17:23:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-21 17:23:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 17:23:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2023-12-21 17:23:56,978 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 79 [2023-12-21 17:23:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:23:56,979 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2023-12-21 17:23:56,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 17:23:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2023-12-21 17:23:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-21 17:23:56,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:23:56,980 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:23:57,001 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 (12)] Forceful destruction successful, exit code 0 [2023-12-21 17:23:57,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-21 17:23:57,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:23:57,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:23:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 545495682, now seen corresponding path program 2 times [2023-12-21 17:23:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:23:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499478592] [2023-12-21 17:23:57,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:23:57,182 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-21 17:23:57,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:23:57,183 INFO L229 MonitoredProcess]: Starting monitored process 13 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-21 17:23:57,185 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 (13)] Waiting until timeout for monitored process [2023-12-21 17:23:58,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:23:58,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-21 17:23:58,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 17:23:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 17:23:58,889 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 17:23:58,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 17:23:58,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 17:23:58,926 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 (13)] Forceful destruction successful, exit code 0 [2023-12-21 17:23:59,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-21 17:23:59,095 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1] [2023-12-21 17:23:59,098 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 17:23:59,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-21 17:23:59,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:23:59 BoogieIcfgContainer [2023-12-21 17:23:59,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 17:23:59,164 INFO L158 Benchmark]: Toolchain (without parser) took 10863.69ms. Allocated memory is still 358.6MB. Free memory was 306.5MB in the beginning and 240.9MB in the end (delta: 65.7MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. [2023-12-21 17:23:59,164 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 195.0MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 17:23:59,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.29ms. Allocated memory is still 358.6MB. Free memory was 306.2MB in the beginning and 294.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 17:23:59,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 358.6MB. Free memory was 294.0MB in the beginning and 292.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:23:59,165 INFO L158 Benchmark]: Boogie Preprocessor took 42.86ms. Allocated memory is still 358.6MB. Free memory was 292.2MB in the beginning and 290.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:23:59,165 INFO L158 Benchmark]: RCFGBuilder took 659.00ms. Allocated memory is still 358.6MB. Free memory was 290.1MB in the beginning and 275.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 17:23:59,166 INFO L158 Benchmark]: TraceAbstraction took 9816.50ms. Allocated memory is still 358.6MB. Free memory was 274.7MB in the beginning and 240.9MB in the end (delta: 33.9MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB. [2023-12-21 17:23:59,167 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.18ms. Allocated memory is still 195.0MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.29ms. Allocated memory is still 358.6MB. Free memory was 306.2MB in the beginning and 294.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 358.6MB. Free memory was 294.0MB in the beginning and 292.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.86ms. Allocated memory is still 358.6MB. Free memory was 292.2MB in the beginning and 290.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 659.00ms. Allocated memory is still 358.6MB. Free memory was 290.1MB in the beginning and 275.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9816.50ms. Allocated memory is still 358.6MB. Free memory was 274.7MB in the beginning and 240.9MB in the end (delta: 33.9MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[5]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={-2147483648:0}, x={-2147483648:0}] [L17] COND FALSE !(i < 5) VAL [i=5, x={-2147483648:0}, x={-2147483648:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={-2147483648:0}] [L49] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=1, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L49] RET, EXPR rangesum(x) VAL [x={-2147483648:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=1, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L52] RET, EXPR rangesum(x) VAL [ret=0, temp=0, x={-2147483648:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND FALSE !(i<5 -1) VAL [i=4, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L57] x[5 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 5 VAL [cnt=1, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=4, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=5, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-1073741824, cnt=2, i=5, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [ret2=0, ret5=-1073741824, ret=0, temp=-2147483648, x={-2147483648:0}] [L61] reach_error() VAL [ret2=0, ret5=-1073741824, ret=0, temp=-2147483648, x={-2147483648:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 12, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 789 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 540 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 249 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 855 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=11, InterpolantAutomatonStates: 55, 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, 11 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 619 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 1063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1121 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2203/2545 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 proved your program to be incorrect! [2023-12-21 17:23:59,211 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 0 Received shutdown request...