/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/rangesum40.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 17:24:13,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 17:24:13,908 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:24:13,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 17:24:13,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 17:24:13,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 17:24:13,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 17:24:13,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 17:24:13,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 17:24:13,942 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 17:24:13,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 17:24:13,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 17:24:13,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 17:24:13,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 17:24:13,944 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 17:24:13,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 17:24:13,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 17:24:13,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 17:24:13,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 17:24:13,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 17:24:13,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 17:24:13,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 17:24:13,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 17:24:13,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 17:24:13,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 17:24:13,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 17:24:13,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 17:24:13,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:24:13,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 17:24:13,948 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 17:24:13,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 17:24:13,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 17:24:13,949 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 17:24:13,949 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:24:14,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 17:24:14,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 17:24:14,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 17:24:14,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 17:24:14,158 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 17:24:14,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum40.i [2023-12-21 17:24:15,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 17:24:15,340 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 17:24:15,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum40.i [2023-12-21 17:24:15,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb3cf5e1/8366b3bfbd23472fa6fb6eca03ebcd58/FLAGe471cfd9d [2023-12-21 17:24:15,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb3cf5e1/8366b3bfbd23472fa6fb6eca03ebcd58 [2023-12-21 17:24:15,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 17:24:15,373 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 17:24:15,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 17:24:15,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 17:24:15,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 17:24:15,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f1e022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15, skipping insertion in model container [2023-12-21 17:24:15,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,395 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 17:24:15,548 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/rangesum40.i[1465,1478] [2023-12-21 17:24:15,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:24:15,562 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 17:24:15,589 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/rangesum40.i[1465,1478] [2023-12-21 17:24:15,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:24:15,599 INFO L206 MainTranslator]: Completed translation [2023-12-21 17:24:15,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15 WrapperNode [2023-12-21 17:24:15,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 17:24:15,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 17:24:15,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 17:24:15,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 17:24:15,605 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:24:15" (1/1) ... [2023-12-21 17:24:15,620 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:24:15" (1/1) ... [2023-12-21 17:24:15,632 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-12-21 17:24:15,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 17:24:15,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 17:24:15,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 17:24:15,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 17:24:15,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,664 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:24:15,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 17:24:15,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 17:24:15,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 17:24:15,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 17:24:15,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (1/1) ... [2023-12-21 17:24:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:24:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 17:24:15,709 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:24:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 17:24:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 17:24:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 17:24:15,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 17:24:15,732 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:24:15,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 17:24:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 17:24:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 17:24:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 17:24:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-12-21 17:24:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-12-21 17:24:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 17:24:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 17:24:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 17:24:15,819 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 17:24:15,821 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 17:24:16,233 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 17:24:16,254 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 17:24:16,254 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 17:24:16,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:24:16 BoogieIcfgContainer [2023-12-21 17:24:16,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 17:24:16,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 17:24:16,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 17:24:16,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 17:24:16,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:24:15" (1/3) ... [2023-12-21 17:24:16,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0edb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:24:16, skipping insertion in model container [2023-12-21 17:24:16,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:24:15" (2/3) ... [2023-12-21 17:24:16,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0edb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:24:16, skipping insertion in model container [2023-12-21 17:24:16,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:24:16" (3/3) ... [2023-12-21 17:24:16,260 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum40.i [2023-12-21 17:24:16,276 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 17:24:16,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 17:24:16,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 17:24:16,314 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;@509101b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 17:24:16,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 17:24:16,317 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:24:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 17:24:16,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:16,324 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:24:16,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:16,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2023-12-21 17:24:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939238703] [2023-12-21 17:24:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:16,342 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:24:16,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:16,346 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:24:16,351 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:24:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:16,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 17:24:16,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:16,690 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:24:16,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:24:16,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939238703] [2023-12-21 17:24:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939238703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:24:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:24:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:24:16,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382033691] [2023-12-21 17:24:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:24:16,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 17:24:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 17:24:16,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 17:24:16,725 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:24:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:16,759 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2023-12-21 17:24:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 17:24:16,761 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:24:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:16,766 INFO L225 Difference]: With dead ends: 44 [2023-12-21 17:24:16,766 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 17:24:16,769 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:24:16,774 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:24:16,776 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:24:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 17:24:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 17:24:16,800 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:24:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-12-21 17:24:16,802 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 28 [2023-12-21 17:24:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:16,802 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-12-21 17:24:16,802 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:24:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-12-21 17:24:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 17:24:16,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:16,803 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:24:16,818 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:24:17,019 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:24:17,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:17,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1260265879, now seen corresponding path program 1 times [2023-12-21 17:24:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548030197] [2023-12-21 17:24:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:17,021 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:24:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:17,022 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:24:17,031 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:24:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:17,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:24:17,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:17,342 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:24:17,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:24:17,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548030197] [2023-12-21 17:24:17,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548030197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:24:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:24:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:24:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336501516] [2023-12-21 17:24:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:24:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:24:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:24:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:24:17,345 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:24:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:17,368 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-21 17:24:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:24:17,369 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:24:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:17,370 INFO L225 Difference]: With dead ends: 41 [2023-12-21 17:24:17,370 INFO L226 Difference]: Without dead ends: 22 [2023-12-21 17:24:17,370 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:24:17,371 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:24:17,371 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:24:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-21 17:24:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-21 17:24:17,375 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:24:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-21 17:24:17,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2023-12-21 17:24:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:17,376 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-21 17:24:17,376 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:24:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-21 17:24:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 17:24:17,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:17,377 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:24:17,391 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:24:17,583 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:24:17,584 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:17,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2023-12-21 17:24:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:17,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391704779] [2023-12-21 17:24:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:17,585 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:24:17,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:17,586 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:24:17,587 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:24:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:17,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:24:17,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:17,902 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:24:17,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:17,942 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:24:17,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391704779] [2023-12-21 17:24:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391704779] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:17,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-21 17:24:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269524559] [2023-12-21 17:24:17,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:17,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:24:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:24:17,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:24:17,945 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:24:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:18,000 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-12-21 17:24:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:24:18,000 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:24:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:18,001 INFO L225 Difference]: With dead ends: 44 [2023-12-21 17:24:18,001 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 17:24:18,001 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:24:18,002 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:24:18,002 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:24:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 17:24:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 17:24:18,005 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:24:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-21 17:24:18,006 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2023-12-21 17:24:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:18,006 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-21 17:24:18,006 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:24:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-21 17:24:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 17:24:18,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:18,007 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:24:18,021 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:24:18,220 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:24:18,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:18,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1860680425, now seen corresponding path program 2 times [2023-12-21 17:24:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599076090] [2023-12-21 17:24:18,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:24:18,222 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:24:18,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:18,225 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:24:18,226 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:24:18,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:24:18,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:18,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:24:18,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:18,356 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:24:18,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:24:18,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599076090] [2023-12-21 17:24:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599076090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:24:18,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:24:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:24:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540439160] [2023-12-21 17:24:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:24:18,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:24:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:24:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:24:18,358 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:24:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:18,402 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-21 17:24:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:24:18,403 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:24:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:18,404 INFO L225 Difference]: With dead ends: 45 [2023-12-21 17:24:18,404 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 17:24:18,404 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:24:18,405 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:24:18,405 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:24:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 17:24:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-21 17:24:18,408 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:24:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-21 17:24:18,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2023-12-21 17:24:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:18,409 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-21 17:24:18,409 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:24:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-21 17:24:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-21 17:24:18,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:18,410 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:24:18,429 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:24:18,620 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:24:18,620 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:18,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1838186572, now seen corresponding path program 1 times [2023-12-21 17:24:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096339758] [2023-12-21 17:24:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:18,623 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:24:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:18,624 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:24:18,630 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:24:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:18,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:24:18,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:18,975 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:24:18,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:19,098 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:24:19,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:19,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096339758] [2023-12-21 17:24:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096339758] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:19,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-21 17:24:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947705233] [2023-12-21 17:24:19,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:19,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:24:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:24:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:24:19,100 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:24:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:19,304 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-12-21 17:24:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:24:19,305 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:24:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:19,306 INFO L225 Difference]: With dead ends: 54 [2023-12-21 17:24:19,306 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 17:24:19,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:24:19,307 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:19,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:24:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 17:24:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-21 17:24:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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:24:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-12-21 17:24:19,311 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 41 [2023-12-21 17:24:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:19,312 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-12-21 17:24:19,312 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:24:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-12-21 17:24:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 17:24:19,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:19,313 INFO L195 NwaCegarLoop]: trace histogram [10, 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:24:19,330 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:24:19,524 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:24:19,525 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:19,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:19,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1916929268, now seen corresponding path program 2 times [2023-12-21 17:24:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:19,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562127178] [2023-12-21 17:24:19,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:24:19,526 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:24:19,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:19,527 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:24:19,528 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:24:19,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:24:19,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:19,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:24:19,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 17:24:19,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:24:19,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562127178] [2023-12-21 17:24:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562127178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:24:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:24:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:24:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126058634] [2023-12-21 17:24:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:24:19,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:24:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:24:19,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:24:19,685 INFO L87 Difference]: Start difference. First operand 33 states and 39 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:24:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:19,792 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2023-12-21 17:24:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:24:19,795 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 47 [2023-12-21 17:24:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:19,797 INFO L225 Difference]: With dead ends: 58 [2023-12-21 17:24:19,797 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 17:24:19,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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:24:19,798 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.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:19,798 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.1s Time] [2023-12-21 17:24:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 17:24:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-21 17:24:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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:24:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-21 17:24:19,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 47 [2023-12-21 17:24:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:19,805 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-21 17:24:19,805 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:24:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-21 17:24:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 17:24:19,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:19,806 INFO L195 NwaCegarLoop]: trace histogram [10, 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:24:19,815 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:24:20,013 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:24:20,016 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:20,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash 693749521, now seen corresponding path program 1 times [2023-12-21 17:24:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701404577] [2023-12-21 17:24:20,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:20,017 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:24:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:20,018 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:24:20,018 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:24:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:20,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 17:24:20,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:24:20,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:24:20,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701404577] [2023-12-21 17:24:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701404577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:20,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2023-12-21 17:24:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245049720] [2023-12-21 17:24:20,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:20,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 17:24:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 17:24:20,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:24:20,599 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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:24:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:21,556 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2023-12-21 17:24:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 17:24:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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 47 [2023-12-21 17:24:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:21,558 INFO L225 Difference]: With dead ends: 74 [2023-12-21 17:24:21,558 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 17:24:21,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 17:24:21,559 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:21,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:24:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 17:24:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-21 17:24:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 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:24:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-12-21 17:24:21,565 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 47 [2023-12-21 17:24:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:21,565 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-12-21 17:24:21,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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:24:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-12-21 17:24:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 17:24:21,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:21,566 INFO L195 NwaCegarLoop]: trace histogram [22, 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:24:21,574 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 (8)] Ended with exit code 0 [2023-12-21 17:24:21,769 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:24:21,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:21,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1577582191, now seen corresponding path program 2 times [2023-12-21 17:24:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501057016] [2023-12-21 17:24:21,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:24:21,771 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:24:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:21,774 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:24:21,775 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:24:21,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:24:21,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:21,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:24:21,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:24:22,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 17:24:23,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501057016] [2023-12-21 17:24:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501057016] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:23,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-12-21 17:24:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321032858] [2023-12-21 17:24:23,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:24:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:24:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1649, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:24:23,572 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 48 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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:24:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:26,808 INFO L93 Difference]: Finished difference Result 92 states and 125 transitions. [2023-12-21 17:24:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 17:24:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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 59 [2023-12-21 17:24:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:26,810 INFO L225 Difference]: With dead ends: 92 [2023-12-21 17:24:26,810 INFO L226 Difference]: Without dead ends: 67 [2023-12-21 17:24:26,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1279, Invalid=2753, Unknown=0, NotChecked=0, Total=4032 [2023-12-21 17:24:26,812 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:26,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 530 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 17:24:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-21 17:24:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-21 17:24:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 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:24:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2023-12-21 17:24:26,819 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 59 [2023-12-21 17:24:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:26,819 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2023-12-21 17:24:26,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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:24:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2023-12-21 17:24:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 17:24:26,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:26,820 INFO L195 NwaCegarLoop]: trace histogram [40, 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:24:26,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 17:24:27,023 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:24:27,024 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:27,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash 488657233, now seen corresponding path program 3 times [2023-12-21 17:24:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816420596] [2023-12-21 17:24:27,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:24:27,025 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:24:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:27,026 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:24:27,027 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:24:27,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 17:24:27,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:27,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:24:27,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2023-12-21 17:24:27,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2023-12-21 17:24:27,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816420596] [2023-12-21 17:24:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816420596] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:27,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 17:24:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289967970] [2023-12-21 17:24:27,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:27,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:24:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:27,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:24:27,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:24:27,157 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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:24:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:27,222 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2023-12-21 17:24:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:24:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 77 [2023-12-21 17:24:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:27,224 INFO L225 Difference]: With dead ends: 97 [2023-12-21 17:24:27,224 INFO L226 Difference]: Without dead ends: 74 [2023-12-21 17:24:27,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 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:24:27,225 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:27,225 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.0s Time] [2023-12-21 17:24:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-21 17:24:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2023-12-21 17:24:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 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:24:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2023-12-21 17:24:27,232 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 77 [2023-12-21 17:24:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:27,233 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2023-12-21 17:24:27,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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:24:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2023-12-21 17:24:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 17:24:27,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:27,234 INFO L195 NwaCegarLoop]: trace histogram [40, 12, 12, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:24:27,241 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:24:27,436 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:24:27,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:27,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash -155963031, now seen corresponding path program 1 times [2023-12-21 17:24:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:27,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483179763] [2023-12-21 17:24:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:27,438 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:24:27,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:27,445 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:24:27,449 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:24:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:27,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 17:24:27,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2023-12-21 17:24:27,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 13 proven. 127 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2023-12-21 17:24:27,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:27,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483179763] [2023-12-21 17:24:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483179763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:27,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:27,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-21 17:24:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229940067] [2023-12-21 17:24:27,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 17:24:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:27,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 17:24:27,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 17:24:27,899 INFO L87 Difference]: Start difference. First operand 71 states and 78 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:24:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:27,999 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2023-12-21 17:24:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 17:24:28,000 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 104 [2023-12-21 17:24:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:28,000 INFO L225 Difference]: With dead ends: 107 [2023-12-21 17:24:28,000 INFO L226 Difference]: Without dead ends: 80 [2023-12-21 17:24:28,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-21 17:24:28,001 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:28,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:24:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-21 17:24:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-21 17:24:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 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:24:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-12-21 17:24:28,008 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 104 [2023-12-21 17:24:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:28,008 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-12-21 17:24:28,008 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:24:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-12-21 17:24:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 17:24:28,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:28,009 INFO L195 NwaCegarLoop]: trace histogram [40, 21, 21, 18, 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:24:28,030 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:24:28,224 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:24:28,224 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:28,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash -730307314, now seen corresponding path program 2 times [2023-12-21 17:24:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299911455] [2023-12-21 17:24:28,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:24:28,225 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:24:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:28,226 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:24:28,227 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:24:28,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:24:28,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:28,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 17:24:28,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2023-12-21 17:24:28,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-21 17:24:28,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299911455] [2023-12-21 17:24:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299911455] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:28,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-21 17:24:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28854823] [2023-12-21 17:24:28,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:28,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 17:24:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 17:24:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:24:28,879 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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:24:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:29,261 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2023-12-21 17:24:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 17:24:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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 131 [2023-12-21 17:24:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:29,262 INFO L225 Difference]: With dead ends: 140 [2023-12-21 17:24:29,262 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 17:24:29,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-21 17:24:29,263 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:29,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 147 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:24:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 17:24:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-21 17:24:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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:24:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2023-12-21 17:24:29,270 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 131 [2023-12-21 17:24:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:29,270 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2023-12-21 17:24:29,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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:24:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2023-12-21 17:24:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-12-21 17:24:29,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:29,272 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 42, 40, 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:24:29,293 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:24:29,472 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:24:29,473 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:29,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -647886450, now seen corresponding path program 3 times [2023-12-21 17:24:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669828645] [2023-12-21 17:24:29,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:24:29,474 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:24:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:29,475 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:24:29,476 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:24:29,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 17:24:29,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:29,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:24:29,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 1420 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-21 17:24:29,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:24:29,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669828645] [2023-12-21 17:24:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669828645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:24:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:24:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:24:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729296486] [2023-12-21 17:24:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:24:29,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:24:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:29,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:24:29,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:24:29,727 INFO L87 Difference]: Start difference. First operand 104 states and 110 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:24:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:29,745 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2023-12-21 17:24:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:24:29,746 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 203 [2023-12-21 17:24:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:29,748 INFO L225 Difference]: With dead ends: 161 [2023-12-21 17:24:29,748 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 17:24:29,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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:24:29,749 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:24:29,749 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:24:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 17:24:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-21 17:24:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.05) internal successors, (105), 100 states have internal predecessors, (105), 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:24:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2023-12-21 17:24:29,790 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 203 [2023-12-21 17:24:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:29,790 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2023-12-21 17:24:29,790 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:24:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2023-12-21 17:24:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-21 17:24:29,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:29,794 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 42, 40, 3, 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:24:29,806 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:24:30,006 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:24:30,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:30,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash -342467041, now seen corresponding path program 1 times [2023-12-21 17:24:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131664691] [2023-12-21 17:24:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:24:30,008 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:24:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:30,008 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24:30,010 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 (14)] Waiting until timeout for monitored process [2023-12-21 17:24:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:24:30,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 17:24:30,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3941 backedges. 1381 proven. 301 refuted. 0 times theorem prover too weak. 2259 trivial. 0 not checked. [2023-12-21 17:24:30,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3941 backedges. 29 proven. 1719 refuted. 0 times theorem prover too weak. 2193 trivial. 0 not checked. [2023-12-21 17:24:31,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131664691] [2023-12-21 17:24:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131664691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:31,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:31,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-21 17:24:31,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646178883] [2023-12-21 17:24:31,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:31,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 17:24:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 17:24:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2023-12-21 17:24:31,117 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 32 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 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:24:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:31,848 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2023-12-21 17:24:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 17:24:31,849 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 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 204 [2023-12-21 17:24:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:31,850 INFO L225 Difference]: With dead ends: 187 [2023-12-21 17:24:31,850 INFO L226 Difference]: Without dead ends: 126 [2023-12-21 17:24:31,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 17:24:31,851 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:31,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 327 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 17:24:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-21 17:24:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-21 17:24:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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:24:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2023-12-21 17:24:31,856 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 204 [2023-12-21 17:24:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:31,857 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2023-12-21 17:24:31,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 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:24:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2023-12-21 17:24:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-12-21 17:24:31,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:31,859 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 63, 40, 3, 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:24:31,879 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 (14)] Forceful destruction successful, exit code 0 [2023-12-21 17:24:32,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:24:32,077 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:32,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1613423086, now seen corresponding path program 2 times [2023-12-21 17:24:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063827012] [2023-12-21 17:24:32,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:24:32,078 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:24:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:32,079 INFO L229 MonitoredProcess]: Starting monitored process 15 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:24:32,080 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 (15)] Waiting until timeout for monitored process [2023-12-21 17:24:32,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:24:32,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:32,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:24:32,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7469 backedges. 2996 proven. 715 refuted. 0 times theorem prover too weak. 3758 trivial. 0 not checked. [2023-12-21 17:24:32,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7469 backedges. 0 proven. 3715 refuted. 0 times theorem prover too weak. 3754 trivial. 0 not checked. [2023-12-21 17:24:34,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:34,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063827012] [2023-12-21 17:24:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063827012] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:34,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:34,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-12-21 17:24:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197017037] [2023-12-21 17:24:34,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:34,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:24:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:34,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:24:34,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1649, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:24:34,193 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 48 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 48 states have internal predecessors, (164), 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:24:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:38,136 INFO L93 Difference]: Finished difference Result 265 states and 315 transitions. [2023-12-21 17:24:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-21 17:24:38,137 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 48 states have internal predecessors, (164), 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 267 [2023-12-21 17:24:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:38,138 INFO L225 Difference]: With dead ends: 265 [2023-12-21 17:24:38,138 INFO L226 Difference]: Without dead ends: 183 [2023-12-21 17:24:38,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1398, Invalid=2892, Unknown=0, NotChecked=0, Total=4290 [2023-12-21 17:24:38,140 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 206 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:38,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 434 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 17:24:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-21 17:24:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-12-21 17:24:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.1235955056179776) internal successors, (200), 178 states have internal predecessors, (200), 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:24:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 206 transitions. [2023-12-21 17:24:38,147 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 206 transitions. Word has length 267 [2023-12-21 17:24:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:38,147 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 206 transitions. [2023-12-21 17:24:38,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 48 states have internal predecessors, (164), 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:24:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 206 transitions. [2023-12-21 17:24:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2023-12-21 17:24:38,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:38,150 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 63, 57, 40, 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:24:38,168 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 (15)] Forceful destruction successful, exit code 0 [2023-12-21 17:24:38,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:24:38,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:38,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash 977235406, now seen corresponding path program 3 times [2023-12-21 17:24:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:38,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218417449] [2023-12-21 17:24:38,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:24:38,370 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:24:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:38,371 INFO L229 MonitoredProcess]: Starting monitored process 16 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:24:38,372 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 (16)] Waiting until timeout for monitored process [2023-12-21 17:24:38,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 17:24:38,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:38,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:24:38,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22616 backedges. 9770 proven. 1 refuted. 0 times theorem prover too weak. 12845 trivial. 0 not checked. [2023-12-21 17:24:38,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22616 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22615 trivial. 0 not checked. [2023-12-21 17:24:38,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218417449] [2023-12-21 17:24:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218417449] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:38,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:38,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 17:24:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017496972] [2023-12-21 17:24:38,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:38,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:24:38,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:38,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:24:38,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:24:38,784 INFO L87 Difference]: Start difference. First operand 183 states and 206 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:24:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:38,846 INFO L93 Difference]: Finished difference Result 320 states and 365 transitions. [2023-12-21 17:24:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:24:38,847 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 429 [2023-12-21 17:24:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:38,848 INFO L225 Difference]: With dead ends: 320 [2023-12-21 17:24:38,848 INFO L226 Difference]: Without dead ends: 186 [2023-12-21 17:24:38,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 852 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:24:38,848 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:24:38,849 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:24:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-21 17:24:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-12-21 17:24:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 181 states have internal predecessors, (203), 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:24:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2023-12-21 17:24:38,855 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 429 [2023-12-21 17:24:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:38,855 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2023-12-21 17:24:38,855 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:24:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2023-12-21 17:24:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2023-12-21 17:24:38,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:38,859 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 63, 57, 40, 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:24:38,869 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 (16)] Forceful destruction successful, exit code 0 [2023-12-21 17:24:39,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:24:39,069 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:39,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1947492057, now seen corresponding path program 4 times [2023-12-21 17:24:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426406110] [2023-12-21 17:24:39,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 17:24:39,070 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:24:39,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:39,071 INFO L229 MonitoredProcess]: Starting monitored process 17 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:24:39,072 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 (17)] Waiting until timeout for monitored process [2023-12-21 17:24:40,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 17:24:40,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:41,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:24:41,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 22625 backedges. 9770 proven. 10 refuted. 0 times theorem prover too weak. 12845 trivial. 0 not checked. [2023-12-21 17:24:41,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 22625 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22615 trivial. 0 not checked. [2023-12-21 17:24:41,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:41,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426406110] [2023-12-21 17:24:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426406110] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:41,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-21 17:24:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184176984] [2023-12-21 17:24:41,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:41,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:24:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:24:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:24:41,154 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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:24:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:41,330 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2023-12-21 17:24:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:24:41,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 432 [2023-12-21 17:24:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:41,332 INFO L225 Difference]: With dead ends: 326 [2023-12-21 17:24:41,332 INFO L226 Difference]: Without dead ends: 192 [2023-12-21 17:24:41,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:24:41,333 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:41,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:24:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-21 17:24:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-12-21 17:24:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.1176470588235294) internal successors, (209), 187 states have internal predecessors, (209), 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:24:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2023-12-21 17:24:41,339 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 432 [2023-12-21 17:24:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:41,340 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2023-12-21 17:24:41,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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:24:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2023-12-21 17:24:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2023-12-21 17:24:41,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:41,344 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 63, 57, 40, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:24:41,372 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 (17)] Ended with exit code 0 [2023-12-21 17:24:41,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:24:41,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:41,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2070179897, now seen corresponding path program 5 times [2023-12-21 17:24:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:41,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113184837] [2023-12-21 17:24:41,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 17:24:41,550 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:24:41,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:41,551 INFO L229 MonitoredProcess]: Starting monitored process 18 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:24:41,552 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 (18)] Waiting until timeout for monitored process [2023-12-21 17:24:46,966 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 81 check-sat command(s) [2023-12-21 17:24:46,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:47,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 17:24:47,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22670 backedges. 9770 proven. 55 refuted. 0 times theorem prover too weak. 12845 trivial. 0 not checked. [2023-12-21 17:24:47,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22670 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 22615 trivial. 0 not checked. [2023-12-21 17:24:47,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113184837] [2023-12-21 17:24:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113184837] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:47,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-21 17:24:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171252094] [2023-12-21 17:24:47,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:47,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 17:24:47,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:47,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 17:24:47,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:24:47,601 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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:24:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:48,662 INFO L93 Difference]: Finished difference Result 338 states and 392 transitions. [2023-12-21 17:24:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 17:24:48,663 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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 438 [2023-12-21 17:24:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:48,664 INFO L225 Difference]: With dead ends: 338 [2023-12-21 17:24:48,664 INFO L226 Difference]: Without dead ends: 204 [2023-12-21 17:24:48,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 17:24:48,665 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:48,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:24:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-21 17:24:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2023-12-21 17:24:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.1105527638190955) internal successors, (221), 199 states have internal predecessors, (221), 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:24:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 227 transitions. [2023-12-21 17:24:48,679 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 227 transitions. Word has length 438 [2023-12-21 17:24:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:48,680 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 227 transitions. [2023-12-21 17:24:48,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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:24:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 227 transitions. [2023-12-21 17:24:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2023-12-21 17:24:48,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:48,682 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 63, 57, 40, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:24:48,708 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 (18)] Forceful destruction successful, exit code 0 [2023-12-21 17:24:48,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:24:48,900 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:48,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1696924935, now seen corresponding path program 6 times [2023-12-21 17:24:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958006990] [2023-12-21 17:24:48,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 17:24:48,902 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:24:48,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:48,902 INFO L229 MonitoredProcess]: Starting monitored process 19 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:24:48,903 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 (19)] Waiting until timeout for monitored process [2023-12-21 17:24:54,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2023-12-21 17:24:54,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:24:54,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:24:54,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:24:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22868 backedges. 9770 proven. 253 refuted. 0 times theorem prover too weak. 12845 trivial. 0 not checked. [2023-12-21 17:24:54,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:24:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22868 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 22615 trivial. 0 not checked. [2023-12-21 17:24:55,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:24:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958006990] [2023-12-21 17:24:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958006990] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:24:55,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:24:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-12-21 17:24:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276048872] [2023-12-21 17:24:55,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:24:55,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:24:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:24:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:24:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1655, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:24:55,812 INFO L87 Difference]: Start difference. First operand 204 states and 227 transitions. Second operand has 48 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 48 states have internal predecessors, (73), 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:24:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:24:58,640 INFO L93 Difference]: Finished difference Result 355 states and 414 transitions. [2023-12-21 17:24:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-21 17:24:58,641 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 48 states have internal predecessors, (73), 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 450 [2023-12-21 17:24:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:24:58,642 INFO L225 Difference]: With dead ends: 355 [2023-12-21 17:24:58,642 INFO L226 Difference]: Without dead ends: 221 [2023-12-21 17:24:58,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1216, Invalid=2690, Unknown=0, NotChecked=0, Total=3906 [2023-12-21 17:24:58,643 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:58,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 528 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 17:24:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-21 17:24:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2023-12-21 17:24:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.1018518518518519) internal successors, (238), 216 states have internal predecessors, (238), 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:24:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 244 transitions. [2023-12-21 17:24:58,651 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 244 transitions. Word has length 450 [2023-12-21 17:24:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:24:58,652 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 244 transitions. [2023-12-21 17:24:58,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 48 states have internal predecessors, (73), 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:24:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 244 transitions. [2023-12-21 17:24:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2023-12-21 17:24:58,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:24:58,654 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 63, 57, 40, 39, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:24:58,676 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 (19)] Ended with exit code 0 [2023-12-21 17:24:58,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:24:58,867 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:24:58,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:24:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1390627538, now seen corresponding path program 7 times [2023-12-21 17:24:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:24:58,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085188360] [2023-12-21 17:24:58,868 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 17:24:58,869 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:24:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:24:58,870 INFO L229 MonitoredProcess]: Starting monitored process 20 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:24:58,872 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 (20)] Waiting until timeout for monitored process [2023-12-21 17:25:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 17:25:10,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 17:25:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 17:25:22,530 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 17:25:22,531 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 17:25:22,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 17:25:22,607 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 (20)] Ended with exit code 0 [2023-12-21 17:25:22,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:25:22,751 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 3, 2, 2, 1, 1] [2023-12-21 17:25:22,754 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 17:25:22,845 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-21 17:25:22,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:25:22 BoogieIcfgContainer [2023-12-21 17:25:22,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 17:25:22,894 INFO L158 Benchmark]: Toolchain (without parser) took 67521.08ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 187.8MB in the beginning and 171.9MB in the end (delta: 15.9MB). Peak memory consumption was 64.1MB. Max. memory is 8.0GB. [2023-12-21 17:25:22,894 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 185.6MB. Free memory was 130.2MB in the beginning and 130.1MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 17:25:22,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.17ms. Allocated memory is still 232.8MB. Free memory was 187.3MB in the beginning and 175.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 17:25:22,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.41ms. Allocated memory is still 232.8MB. Free memory was 175.7MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 17:25:22,895 INFO L158 Benchmark]: Boogie Preprocessor took 41.37ms. Allocated memory is still 232.8MB. Free memory was 174.2MB in the beginning and 172.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:25:22,895 INFO L158 Benchmark]: RCFGBuilder took 579.01ms. Allocated memory is still 232.8MB. Free memory was 172.1MB in the beginning and 157.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 17:25:22,895 INFO L158 Benchmark]: TraceAbstraction took 66637.99ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 156.3MB in the beginning and 171.9MB in the end (delta: -15.6MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2023-12-21 17:25:22,896 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.15ms. Allocated memory is still 185.6MB. Free memory was 130.2MB in the beginning and 130.1MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.17ms. Allocated memory is still 232.8MB. Free memory was 187.3MB in the beginning and 175.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.41ms. Allocated memory is still 232.8MB. Free memory was 175.7MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.37ms. Allocated memory is still 232.8MB. Free memory was 174.2MB in the beginning and 172.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.01ms. Allocated memory is still 232.8MB. Free memory was 172.1MB in the beginning and 157.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 66637.99ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 156.3MB in the beginning and 171.9MB in the end (delta: -15.6MB). Peak memory consumption was 32.7MB. 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[40]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=21, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=22, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=23, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=24, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=25, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=26, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=27, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=28, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=29, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=30, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=31, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=32, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=33, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=34, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=35, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=36, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=37, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=38, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=39, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 40 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=40, x={-2147483648:0}, x={-2147483648:0}] [L17] COND FALSE !(i < 40) VAL [i=40, 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 < 40 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=21, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=21, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=21, ret=1030585534, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=22, ret=1030585534, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=1, i=22, ret=1030585534, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=22, ret=1940777782, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=23, ret=1940777782, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=2, i=23, ret=1940777782, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=23, ret=2605732509, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=24, ret=2605732509, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=3, i=24, ret=2605732509, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=24, ret=4227858656, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=25, ret=4227858656, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=4, i=25, ret=4227858656, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=25, ret=4865392865, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=5, i=26, ret=4865392865, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=5, i=26, ret=4865392865, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=26, ret=4124049634, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=6, i=27, ret=4124049634, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=6, i=27, ret=4124049634, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=27, ret=3486515434, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=7, i=28, ret=3486515434, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=7, i=28, ret=3486515434, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=28, ret=4561306602, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=8, i=29, ret=4561306602, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=8, i=29, ret=4561306602, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=29, ret=5099169258, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=9, i=30, ret=5099169258, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=9, i=30, ret=5099169258, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=10, i=30, ret=5870921194, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=10, i=31, ret=5870921194, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=10, i=31, ret=5870921194, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=11, i=31, ret=5368653306, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=11, i=32, ret=5368653306, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=11, i=32, ret=5368653306, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=12, i=32, ret=3489611798, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=12, i=33, ret=3489611798, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=12, i=33, ret=3489611798, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=13, i=33, ret=2744894111, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=13, i=34, ret=2744894111, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=13, i=34, ret=2744894111, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=14, i=34, ret=3567241011, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=14, i=35, ret=3567241011, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=14, i=35, ret=3567241011, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=15, i=35, ret=3651387688, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=15, i=36, ret=3651387688, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=15, i=36, ret=3651387688, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=16, i=36, ret=4524981217, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=16, i=37, ret=4524981217, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=16, i=37, ret=4524981217, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=17, i=37, ret=3360801039, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=17, i=38, ret=3360801039, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=17, i=38, ret=3360801039, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=18, i=38, ret=4300210200, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=18, i=39, ret=4300210200, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=18, i=39, ret=4300210200, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=19, i=39, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=19, i=40, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 40) VAL [cnt=19, i=40, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=226208098, cnt=19, i=40, ret=4297953864, 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 < 40 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=21, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=21, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=21, ret=1030585534, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=22, ret=1030585534, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=1, i=22, ret=1030585534, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=22, ret=1940777782, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=23, ret=1940777782, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=2, i=23, ret=1940777782, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=23, ret=2605732509, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=24, ret=2605732509, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=3, i=24, ret=2605732509, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=24, ret=4227858656, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=25, ret=4227858656, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=4, i=25, ret=4227858656, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=25, ret=4865392865, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=5, i=26, ret=4865392865, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=5, i=26, ret=4865392865, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=26, ret=4124049634, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=6, i=27, ret=4124049634, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=6, i=27, ret=4124049634, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=27, ret=3486515434, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=7, i=28, ret=3486515434, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=7, i=28, ret=3486515434, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=28, ret=4561306602, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=8, i=29, ret=4561306602, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=8, i=29, ret=4561306602, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=29, ret=5099169258, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=9, i=30, ret=5099169258, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=9, i=30, ret=5099169258, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=10, i=30, ret=5870921194, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=10, i=31, ret=5870921194, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=10, i=31, ret=5870921194, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=11, i=31, ret=5368653306, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=11, i=32, ret=5368653306, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=11, i=32, ret=5368653306, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=12, i=32, ret=3489611798, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=12, i=33, ret=3489611798, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=12, i=33, ret=3489611798, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=13, i=33, ret=2744894111, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=13, i=34, ret=2744894111, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=13, i=34, ret=2744894111, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=14, i=34, ret=3567241011, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=14, i=35, ret=3567241011, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=14, i=35, ret=3567241011, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=15, i=35, ret=3651387688, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=15, i=36, ret=3651387688, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=15, i=36, ret=3651387688, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=16, i=36, ret=4524981217, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=16, i=37, ret=4524981217, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=16, i=37, ret=4524981217, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=17, i=37, ret=3360801039, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=17, i=38, ret=3360801039, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=17, i=38, ret=3360801039, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=18, i=38, ret=4300210200, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=18, i=39, ret=4300210200, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=18, i=39, ret=4300210200, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=19, i=39, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=19, i=40, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 40) VAL [cnt=19, i=40, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=226208098, cnt=19, i=40, ret=4297953864, x={-2147483648:0}, x={-2147483648:0}] [L52] RET, EXPR rangesum(x) VAL [ret=226208098, 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=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=20, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=21, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=22, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=23, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=24, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=25, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=26, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=27, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=28, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=29, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=30, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=31, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=32, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=33, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=34, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=35, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=36, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=37, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=38, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND TRUE i<40 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=39, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L54] COND FALSE !(i<40 -1) VAL [i=39, ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L57] x[40 -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 < 40 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/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 < 40 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 40/2) VAL [cnt=0, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=21, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=0, i=21, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=21, ret=910192248, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=22, ret=910192248, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=1, i=22, ret=910192248, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=22, ret=1575146975, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=23, ret=1575146975, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=2, i=23, ret=1575146975, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=23, ret=3197273122, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=24, ret=3197273122, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=3, i=24, ret=3197273122, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=24, ret=3834807331, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=25, ret=3834807331, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=4, i=25, ret=3834807331, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=25, ret=3093464100, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=5, i=26, ret=3093464100, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=5, i=26, ret=3093464100, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=26, ret=2455929900, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=6, i=27, ret=2455929900, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=6, i=27, ret=2455929900, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=27, ret=3530721068, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=7, i=28, ret=3530721068, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=7, i=28, ret=3530721068, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=28, ret=4068583724, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=8, i=29, ret=4068583724, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=8, i=29, ret=4068583724, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=29, ret=4840335660, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=9, i=30, ret=4840335660, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=9, i=30, ret=4840335660, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=10, i=30, ret=4338067772, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=10, i=31, ret=4338067772, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=10, i=31, ret=4338067772, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=11, i=31, ret=2459026264, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=11, i=32, ret=2459026264, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=11, i=32, ret=2459026264, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=12, i=32, ret=1714308577, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=12, i=33, ret=1714308577, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=12, i=33, ret=1714308577, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=13, i=33, ret=2536655477, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=13, i=34, ret=2536655477, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=13, i=34, ret=2536655477, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=14, i=34, ret=2620802154, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=14, i=35, ret=2620802154, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=14, i=35, ret=2620802154, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=15, i=35, ret=3494395683, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=15, i=36, ret=3494395683, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=15, i=36, ret=3494395683, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=16, i=36, ret=2330215505, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=16, i=37, ret=2330215505, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=16, i=37, ret=2330215505, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=17, i=37, ret=3269624666, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=17, i=38, ret=3269624666, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=17, i=38, ret=3269624666, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=18, i=38, ret=3267368330, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=18, i=39, ret=3267368330, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 40 VAL [cnt=18, i=39, ret=3267368330, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 40/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=19, i=39, ret=2179743554, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=19, i=40, ret=2179743554, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 40) VAL [cnt=19, i=40, ret=2179743554, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=114723344, cnt=19, i=40, ret=2179743554, x={-2147483648:0}, x={-2147483648:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=226208098, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [ret2=226208098, ret5=114723344, ret=226208098, temp=-1087624776, x={-2147483648:0}] [L61] reach_error() VAL [ret2=226208098, ret5=114723344, ret=226208098, temp=-1087624776, x={-2147483648:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.5s, OverallIterations: 19, TraceHistogramMax: 120, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 3277 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2866 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4305 IncrementalHoareTripleChecker+Invalid, 4523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 411 mSDtfsCounter, 4305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5818 GetRequests, 5456 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=18, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 26.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3513 NumberOfCodeBlocks, 2546 NumberOfCodeBlocksAsserted, 130 NumberOfCheckSat, 5723 ConstructedInterpolants, 0 QuantifiedInterpolants, 7197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4649 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 207921/216227 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:25:22,917 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...