/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/rangesum10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:54:47,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:54:47,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 06:54:47,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:54:47,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:54:47,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:54:47,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:54:47,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:54:47,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:54:47,612 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:54:47,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:54:47,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:54:47,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:54:47,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:54:47,613 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:54:47,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:54:47,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:54:47,614 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:54:47,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:54:47,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:54:47,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:54:47,616 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:54:47,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:54:47,617 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:54:47,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:54:47,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:54:47,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:54:47,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:54:47,619 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:54:47,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:54:47,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:54:47,619 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:54:47,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 06:54:47,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:54:47,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:54:47,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:54:47,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:54:47,845 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:54:47,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum10.i [2023-12-16 06:54:48,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:54:48,992 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:54:48,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum10.i [2023-12-16 06:54:48,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a135d5d4b/516ae86a0e1b4975b7bd916d36771b3f/FLAG4c5b6407b [2023-12-16 06:54:49,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a135d5d4b/516ae86a0e1b4975b7bd916d36771b3f [2023-12-16 06:54:49,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:54:49,017 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:54:49,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:54:49,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:54:49,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:54:49,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecdf254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49, skipping insertion in model container [2023-12-16 06:54:49,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:54:49,172 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/rangesum10.i[1465,1478] [2023-12-16 06:54:49,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:54:49,206 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:54:49,230 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/rangesum10.i[1465,1478] [2023-12-16 06:54:49,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:54:49,241 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:54:49,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49 WrapperNode [2023-12-16 06:54:49,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:54:49,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:54:49,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:54:49,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:54:49,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,279 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-12-16 06:54:49,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:54:49,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:54:49,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:54:49,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:54:49,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,306 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-16 06:54:49,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:54:49,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:54:49,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:54:49,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:54:49,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (1/1) ... [2023-12-16 06:54:49,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:54:49,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:54:49,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 06:54:49,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 06:54:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:54:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:54:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:54:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 06:54:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:54:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:54:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:54:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:54:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-12-16 06:54:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-12-16 06:54:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 06:54:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:54:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:54:49,478 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:54:49,480 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:54:49,941 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:54:49,974 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:54:49,974 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 06:54:49,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:54:49 BoogieIcfgContainer [2023-12-16 06:54:49,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:54:49,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:54:49,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:54:49,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:54:49,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:54:49" (1/3) ... [2023-12-16 06:54:49,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b78d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:54:49, skipping insertion in model container [2023-12-16 06:54:49,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:49" (2/3) ... [2023-12-16 06:54:49,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b78d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:54:49, skipping insertion in model container [2023-12-16 06:54:49,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:54:49" (3/3) ... [2023-12-16 06:54:49,985 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2023-12-16 06:54:49,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:54:49,998 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:54:50,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:54:50,033 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;@6a9be51d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:54:50,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:54:50,036 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-16 06:54:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 06:54:50,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:50,042 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-16 06:54:50,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:50,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2023-12-16 06:54:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73518631] [2023-12-16 06:54:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:50,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:50,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:50,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:50,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 (2)] Waiting until timeout for monitored process [2023-12-16 06:54:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:50,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 06:54:50,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:50,392 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-16 06:54:50,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:50,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73518631] [2023-12-16 06:54:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73518631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:50,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:50,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:54:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109885825] [2023-12-16 06:54:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 06:54:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:50,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 06:54:50,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:54:50,432 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-16 06:54:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:50,462 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2023-12-16 06:54:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 06:54:50,464 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-16 06:54:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:50,470 INFO L225 Difference]: With dead ends: 44 [2023-12-16 06:54:50,470 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 06:54:50,473 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-16 06:54:50,477 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-16 06:54:50,478 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-16 06:54:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 06:54:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 06:54:50,499 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-16 06:54:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-12-16 06:54:50,502 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 28 [2023-12-16 06:54:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:50,503 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-12-16 06:54:50,503 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-16 06:54:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-12-16 06:54:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 06:54:50,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:50,504 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-16 06:54:50,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 06:54:50,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:50,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:50,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1260265879, now seen corresponding path program 1 times [2023-12-16 06:54:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299064660] [2023-12-16 06:54:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:50,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:50,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:50,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:50,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 06:54:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:51,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:51,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:51,022 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-16 06:54:51,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:51,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299064660] [2023-12-16 06:54:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299064660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:51,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:54:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048976684] [2023-12-16 06:54:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:51,025 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-16 06:54:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:51,047 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-16 06:54:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:51,047 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-16 06:54:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:51,048 INFO L225 Difference]: With dead ends: 41 [2023-12-16 06:54:51,048 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 06:54:51,048 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-16 06:54:51,049 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-16 06:54:51,050 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-16 06:54:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 06:54:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 06:54:51,053 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-16 06:54:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-16 06:54:51,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2023-12-16 06:54:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:51,054 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-16 06:54:51,054 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-16 06:54:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-16 06:54:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 06:54:51,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:51,055 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-16 06:54:51,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:51,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:51,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:51,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2023-12-16 06:54:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712830899] [2023-12-16 06:54:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:51,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:51,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:51,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 06:54:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:51,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:54:51,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:51,619 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-16 06:54:51,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:51,678 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-16 06:54:51,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712830899] [2023-12-16 06:54:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712830899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:51,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-16 06:54:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529898413] [2023-12-16 06:54:51,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:51,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:54:51,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:54:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:54:51,681 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-16 06:54:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:51,738 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-12-16 06:54:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:54:51,739 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-16 06:54:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:51,739 INFO L225 Difference]: With dead ends: 44 [2023-12-16 06:54:51,739 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 06:54:51,740 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-16 06:54:51,741 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-16 06:54:51,741 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-16 06:54:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 06:54:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 06:54:51,744 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-16 06:54:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-16 06:54:51,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2023-12-16 06:54:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:51,745 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-16 06:54:51,745 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-16 06:54:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-16 06:54:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 06:54:51,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:51,745 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-16 06:54:51,759 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-16 06:54:51,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:51,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:51,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1860680425, now seen corresponding path program 2 times [2023-12-16 06:54:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:51,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476394193] [2023-12-16 06:54:51,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:51,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:51,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:51,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 06:54:52,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:54:52,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:52,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:52,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:52,128 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-16 06:54:52,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:52,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476394193] [2023-12-16 06:54:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476394193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:52,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:52,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:54:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345356507] [2023-12-16 06:54:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:52,130 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-16 06:54:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:52,172 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-16 06:54:52,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:52,173 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-16 06:54:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:52,174 INFO L225 Difference]: With dead ends: 45 [2023-12-16 06:54:52,174 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 06:54:52,174 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-16 06:54:52,175 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-16 06:54:52,175 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-16 06:54:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 06:54:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-16 06:54:52,178 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-16 06:54:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-16 06:54:52,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2023-12-16 06:54:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:52,179 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-16 06:54:52,179 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-16 06:54:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-16 06:54:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 06:54:52,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:52,180 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-16 06:54:52,196 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 (5)] Ended with exit code 0 [2023-12-16 06:54:52,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:52,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:52,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1838186572, now seen corresponding path program 1 times [2023-12-16 06:54:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493688603] [2023-12-16 06:54:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:52,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:52,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 06:54:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:52,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:54:52,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:52,745 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-16 06:54:52,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:52,869 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-16 06:54:52,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493688603] [2023-12-16 06:54:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493688603] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:52,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-16 06:54:52,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745824517] [2023-12-16 06:54:52,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:52,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:54:52,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:52,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:54:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:54:52,871 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-16 06:54:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:53,108 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-12-16 06:54:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:54:53,109 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-16 06:54:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:53,110 INFO L225 Difference]: With dead ends: 54 [2023-12-16 06:54:53,110 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 06:54:53,110 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-16 06:54:53,111 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-16 06:54:53,111 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-16 06:54:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 06:54:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-16 06:54:53,115 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-16 06:54:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-12-16 06:54:53,115 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 41 [2023-12-16 06:54:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:53,115 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-12-16 06:54:53,115 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-16 06:54:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-12-16 06:54:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 06:54:53,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:53,116 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-16 06:54:53,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:53,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:53,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:53,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1916929268, now seen corresponding path program 2 times [2023-12-16 06:54:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445888224] [2023-12-16 06:54:53,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:53,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:53,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 06:54:53,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:54:53,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:53,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:53,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:53,494 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-16 06:54:53,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:53,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445888224] [2023-12-16 06:54:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445888224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:54:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767169683] [2023-12-16 06:54:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:53,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:53,496 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-16 06:54:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:53,672 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2023-12-16 06:54:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:53,674 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-16 06:54:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:53,675 INFO L225 Difference]: With dead ends: 58 [2023-12-16 06:54:53,675 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 06:54:53,676 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-16 06:54:53,676 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:53,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:54:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 06:54:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-16 06:54:53,682 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-16 06:54:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-16 06:54:53,683 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 47 [2023-12-16 06:54:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:53,683 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-16 06:54:53,683 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-16 06:54:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-16 06:54:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 06:54:53,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:53,684 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-16 06:54:53,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:53,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:53,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:53,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 693749521, now seen corresponding path program 1 times [2023-12-16 06:54:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32181516] [2023-12-16 06:54:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:53,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:53,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 06:54:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:53,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:54:53,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-16 06:54:53,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-16 06:54:54,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:54,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32181516] [2023-12-16 06:54:54,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32181516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:54,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:54,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 06:54:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421767279] [2023-12-16 06:54:54,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:54,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:54:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:54:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:54:54,035 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:54:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:54,129 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2023-12-16 06:54:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:54:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2023-12-16 06:54:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:54,130 INFO L225 Difference]: With dead ends: 67 [2023-12-16 06:54:54,130 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 06:54:54,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 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-16 06:54:54,131 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:54,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:54:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 06:54:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2023-12-16 06:54:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-16 06:54:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-12-16 06:54:54,137 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 47 [2023-12-16 06:54:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:54,137 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-12-16 06:54:54,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:54:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-12-16 06:54:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 06:54:54,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:54,138 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:54,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:54,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:54,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:54,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 872358825, now seen corresponding path program 1 times [2023-12-16 06:54:54,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949688702] [2023-12-16 06:54:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:54,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:54,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:54,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 06:54:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:54,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 06:54:54,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-16 06:54:54,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 13 proven. 127 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-16 06:54:54,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949688702] [2023-12-16 06:54:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949688702] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:54,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 06:54:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926013092] [2023-12-16 06:54:54,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:54:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:54:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:54:54,833 INFO L87 Difference]: Start difference. First operand 41 states and 48 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-16 06:54:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:54,970 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2023-12-16 06:54:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 06:54:54,971 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 74 [2023-12-16 06:54:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:54,971 INFO L225 Difference]: With dead ends: 77 [2023-12-16 06:54:54,971 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 06:54:54,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 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-16 06:54:54,972 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:54,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:54:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 06:54:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-16 06:54:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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-16 06:54:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2023-12-16 06:54:54,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 74 [2023-12-16 06:54:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:54,977 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2023-12-16 06:54:54,977 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-16 06:54:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2023-12-16 06:54:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 06:54:54,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:54,978 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:54,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:55,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:55,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1713900238, now seen corresponding path program 2 times [2023-12-16 06:54:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960881180] [2023-12-16 06:54:55,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:55,191 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:54:55,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 06:54:55,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:54:55,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:55,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 06:54:55,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2023-12-16 06:54:55,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2023-12-16 06:54:55,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960881180] [2023-12-16 06:54:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960881180] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:55,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:55,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-16 06:54:55,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955202968] [2023-12-16 06:54:55,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:55,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 06:54:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 06:54:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-12-16 06:54:55,926 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-16 06:54:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:56,270 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2023-12-16 06:54:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:54:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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 101 [2023-12-16 06:54:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:56,272 INFO L225 Difference]: With dead ends: 98 [2023-12-16 06:54:56,272 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 06:54:56,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:54:56,273 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:56,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 182 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:54:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 06:54:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 06:54:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 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-16 06:54:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-12-16 06:54:56,279 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 101 [2023-12-16 06:54:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:56,279 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-12-16 06:54:56,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 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-16 06:54:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-12-16 06:54:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 06:54:56,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:56,280 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:56,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:56,500 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-16 06:54:56,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:56,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash -262311671, now seen corresponding path program 3 times [2023-12-16 06:54:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391860793] [2023-12-16 06:54:56,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:54:56,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:56,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:56,502 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-16 06:54:56,503 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-16 06:54:56,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 06:54:56,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:56,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:56,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1465 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2023-12-16 06:54:56,745 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:56,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391860793] [2023-12-16 06:54:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391860793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:54:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374592089] [2023-12-16 06:54:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:56,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:56,747 INFO L87 Difference]: Start difference. First operand 62 states and 70 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-16 06:54:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:56,767 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2023-12-16 06:54:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:56,767 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 128 [2023-12-16 06:54:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:56,768 INFO L225 Difference]: With dead ends: 107 [2023-12-16 06:54:56,768 INFO L226 Difference]: Without dead ends: 63 [2023-12-16 06:54:56,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:56,769 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-16 06:54:56,769 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-16 06:54:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-16 06:54:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-12-16 06:54:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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-16 06:54:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2023-12-16 06:54:56,774 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 128 [2023-12-16 06:54:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:56,774 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2023-12-16 06:54:56,774 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-16 06:54:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2023-12-16 06:54:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 06:54:56,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:56,775 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:56,794 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-16 06:54:56,985 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-16 06:54:56,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:56,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1333347152, now seen corresponding path program 1 times [2023-12-16 06:54:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251224964] [2023-12-16 06:54:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:56,987 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-16 06:54:56,991 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-16 06:54:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:57,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:54:57,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 650 proven. 1 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2023-12-16 06:54:57,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2023-12-16 06:54:57,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251224964] [2023-12-16 06:54:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251224964] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:57,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 06:54:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256358923] [2023-12-16 06:54:57,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:57,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:54:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:57,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:54:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:54:57,483 INFO L87 Difference]: Start difference. First operand 63 states and 71 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-16 06:54:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:57,544 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2023-12-16 06:54:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:54:57,545 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 129 [2023-12-16 06:54:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:57,546 INFO L225 Difference]: With dead ends: 110 [2023-12-16 06:54:57,546 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 06:54:57,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 252 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-16 06:54:57,547 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:57,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:54:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 06:54:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-16 06:54:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 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-16 06:54:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2023-12-16 06:54:57,553 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 129 [2023-12-16 06:54:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:57,553 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2023-12-16 06:54:57,553 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-16 06:54:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2023-12-16 06:54:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 06:54:57,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:57,554 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:57,572 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-16 06:54:57,754 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-16 06:54:57,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:57,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1445372617, now seen corresponding path program 2 times [2023-12-16 06:54:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:57,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902128202] [2023-12-16 06:54:57,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:57,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:57,757 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-16 06:54:57,773 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-16 06:54:58,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:54:58,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:58,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:54:58,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1475 backedges. 650 proven. 10 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2023-12-16 06:54:58,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1475 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2023-12-16 06:54:58,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:58,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902128202] [2023-12-16 06:54:58,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902128202] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:58,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 06:54:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210518103] [2023-12-16 06:54:58,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:54:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:54:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:54:58,489 INFO L87 Difference]: Start difference. First operand 66 states and 74 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-16 06:54:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:58,681 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2023-12-16 06:54:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 06:54:58,682 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 132 [2023-12-16 06:54:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:58,683 INFO L225 Difference]: With dead ends: 115 [2023-12-16 06:54:58,683 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 06:54:58,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2023-12-16 06:54:58,683 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:58,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:54:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 06:54:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-16 06:54:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 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-16 06:54:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-12-16 06:54:58,690 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 132 [2023-12-16 06:54:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:58,690 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-12-16 06:54:58,690 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-16 06:54:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-12-16 06:54:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 06:54:58,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:58,691 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:58,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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:58,908 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-16 06:54:58,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:58,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1194088144, now seen corresponding path program 3 times [2023-12-16 06:54:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444019691] [2023-12-16 06:54:58,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:54:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:54:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:58,910 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-16 06:54:58,911 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-16 06:55:02,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2023-12-16 06:55:02,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 06:55:02,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 06:55:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 06:55:04,149 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 06:55:04,149 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 06:55:04,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 06:55:04,185 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-16 06:55:04,351 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-16 06:55:04,354 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1] [2023-12-16 06:55:04,357 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:55:04,391 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-16 06:55:04,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:55:04 BoogieIcfgContainer [2023-12-16 06:55:04,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:55:04,418 INFO L158 Benchmark]: Toolchain (without parser) took 15401.25ms. Allocated memory is still 305.1MB. Free memory was 251.6MB in the beginning and 255.4MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:55:04,419 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 187.7MB. Free memory was 138.3MB in the beginning and 138.2MB in the end (delta: 89.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:55:04,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.98ms. Allocated memory is still 305.1MB. Free memory was 251.6MB in the beginning and 239.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 06:55:04,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 305.1MB. Free memory was 239.7MB in the beginning and 238.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 06:55:04,419 INFO L158 Benchmark]: Boogie Preprocessor took 38.64ms. Allocated memory is still 305.1MB. Free memory was 238.0MB in the beginning and 235.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 06:55:04,419 INFO L158 Benchmark]: RCFGBuilder took 655.05ms. Allocated memory is still 305.1MB. Free memory was 235.9MB in the beginning and 221.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 06:55:04,419 INFO L158 Benchmark]: TraceAbstraction took 14440.27ms. Allocated memory is still 305.1MB. Free memory was 220.5MB in the beginning and 255.4MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:55:04,420 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.47ms. Allocated memory is still 187.7MB. Free memory was 138.3MB in the beginning and 138.2MB in the end (delta: 89.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.98ms. Allocated memory is still 305.1MB. Free memory was 251.6MB in the beginning and 239.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 305.1MB. Free memory was 239.7MB in the beginning and 238.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.64ms. Allocated memory is still 305.1MB. Free memory was 238.0MB in the beginning and 235.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 655.05ms. Allocated memory is still 305.1MB. Free memory was 235.9MB in the beginning and 221.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14440.27ms. Allocated memory is still 305.1MB. Free memory was 220.5MB in the beginning and 255.4MB in the end (delta: -34.9MB). There was no memory consumed. 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[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={-2147483648:0}, x={-2147483648:0}] [L17] COND FALSE !(i < 10) VAL [i=10, 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 < 10 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=1, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=2, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=3, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=4, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L49] RET, EXPR rangesum(x) VAL [x={-2147483648:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=1, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=2, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=3, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=4, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L52] RET, EXPR rangesum(x) VAL [ret=0, temp=0, x={-2147483648:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND FALSE !(i<10 -1) VAL [i=9, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L57] x[10 -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 < 10 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=1, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=2, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 10 VAL [cnt=3, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=10, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-536870912, cnt=4, i=10, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [ret2=0, ret5=-536870912, ret=0, temp=-2147483648, x={-2147483648:0}] [L61] reach_error() VAL [ret2=0, ret5=-536870912, ret=0, temp=-2147483648, x={-2147483648:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 13, TraceHistogramMax: 30, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 528 IncrementalHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 273 mSDtfsCounter, 528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1366 GetRequests, 1293 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=12, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 953 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1350 ConstructedInterpolants, 0 QuantifiedInterpolants, 1646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1572 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 9250/9918 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-16 06:55:04,440 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...