/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/hardness-nfm22/hardness_variablewrapping_normal_file-69.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 12:21:43,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 12:21:43,426 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-24 12:21:43,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 12:21:43,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 12:21:43,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 12:21:43,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 12:21:43,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 12:21:43,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 12:21:43,468 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 12:21:43,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 12:21:43,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 12:21:43,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 12:21:43,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 12:21:43,472 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 12:21:43,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 12:21:43,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 12:21:43,473 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 12:21:43,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 12:21:43,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 12:21:43,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 12:21:43,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 12:21:43,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 12:21:43,475 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 12:21:43,475 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 12:21:43,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 12:21:43,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 12:21:43,476 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 12:21:43,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 12:21:43,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 12:21:43,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 12:21:43,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 12:21:43,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 12:21:43,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 12:21:43,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:21:43,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 12:21:43,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 12:21:43,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 12:21:43,479 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 12:21:43,479 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 12:21:43,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 12:21:43,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 12:21:43,480 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 12:21:43,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 12:21:43,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 12:21:43,481 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 12:21:43,481 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-24 12:21:43,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 12:21:43,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 12:21:43,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 12:21:43,775 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 12:21:43,775 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 12:21:43,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2023-12-24 12:21:45,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 12:21:45,362 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 12:21:45,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2023-12-24 12:21:45,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e150d36/2cb06b7923f94d8696ddf9047b54a204/FLAGebef9418f [2023-12-24 12:21:45,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e150d36/2cb06b7923f94d8696ddf9047b54a204 [2023-12-24 12:21:45,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 12:21:45,400 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 12:21:45,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 12:21:45,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 12:21:45,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 12:21:45,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e93433f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45, skipping insertion in model container [2023-12-24 12:21:45,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,442 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 12:21:45,573 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-69.i[913,926] [2023-12-24 12:21:45,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:21:45,620 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 12:21:45,629 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-69.i[913,926] [2023-12-24 12:21:45,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:21:45,662 INFO L206 MainTranslator]: Completed translation [2023-12-24 12:21:45,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45 WrapperNode [2023-12-24 12:21:45,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 12:21:45,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 12:21:45,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 12:21:45,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 12:21:45,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,709 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-12-24 12:21:45,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 12:21:45,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 12:21:45,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 12:21:45,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 12:21:45,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,737 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 12:21:45,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 12:21:45,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 12:21:45,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 12:21:45,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 12:21:45,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (1/1) ... [2023-12-24 12:21:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:21:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 12:21:45,798 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-24 12:21:45,822 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-24 12:21:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 12:21:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 12:21:45,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 12:21:45,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 12:21:45,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 12:21:45,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 12:21:45,939 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 12:21:45,944 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 12:21:46,282 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 12:21:46,323 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 12:21:46,323 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 12:21:46,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:21:46 BoogieIcfgContainer [2023-12-24 12:21:46,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 12:21:46,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 12:21:46,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 12:21:46,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 12:21:46,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:21:45" (1/3) ... [2023-12-24 12:21:46,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc16b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:21:46, skipping insertion in model container [2023-12-24 12:21:46,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:21:45" (2/3) ... [2023-12-24 12:21:46,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc16b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:21:46, skipping insertion in model container [2023-12-24 12:21:46,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:21:46" (3/3) ... [2023-12-24 12:21:46,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2023-12-24 12:21:46,380 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 12:21:46,381 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 12:21:46,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 12:21:46,433 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;@165c5458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 12:21:46,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 12:21:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:21:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 12:21:46,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:21:46,452 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:21:46,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:21:46,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:21:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -718405474, now seen corresponding path program 1 times [2023-12-24 12:21:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:21:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103851683] [2023-12-24 12:21:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:21:46,472 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-24 12:21:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:21:46,478 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-24 12:21:46,481 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-24 12:21:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:21:46,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 12:21:46,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:21:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-24 12:21:46,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:21:46,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:21:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103851683] [2023-12-24 12:21:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103851683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:21:46,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:21:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 12:21:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301771835] [2023-12-24 12:21:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:21:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 12:21:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:21:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 12:21:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 12:21:46,729 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 12:21:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:21:46,809 INFO L93 Difference]: Finished difference Result 89 states and 155 transitions. [2023-12-24 12:21:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 12:21:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2023-12-24 12:21:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:21:46,824 INFO L225 Difference]: With dead ends: 89 [2023-12-24 12:21:46,824 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 12:21:46,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-24 12:21:46,830 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:21:46,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:21:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 12:21:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-24 12:21:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:21:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2023-12-24 12:21:46,868 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 93 [2023-12-24 12:21:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:21:46,868 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2023-12-24 12:21:46,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 12:21:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2023-12-24 12:21:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 12:21:46,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:21:46,872 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:21:46,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 12:21:47,079 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-24 12:21:47,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:21:47,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:21:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1042311708, now seen corresponding path program 1 times [2023-12-24 12:21:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:21:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574500014] [2023-12-24 12:21:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:21:47,082 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-24 12:21:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:21:47,084 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-24 12:21:47,085 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-24 12:21:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:21:47,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:21:47,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:22:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:22:11,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:22:11,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:22:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574500014] [2023-12-24 12:22:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574500014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:22:11,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:22:11,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 12:22:11,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663675964] [2023-12-24 12:22:11,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:22:11,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 12:22:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:22:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 12:22:11,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-24 12:22:11,408 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:22:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:22:19,402 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2023-12-24 12:22:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 12:22:19,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2023-12-24 12:22:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:22:19,411 INFO L225 Difference]: With dead ends: 73 [2023-12-24 12:22:19,411 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 12:22:19,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2023-12-24 12:22:19,413 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:22:19,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 131 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-24 12:22:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 12:22:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2023-12-24 12:22:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:22:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2023-12-24 12:22:19,426 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 93 [2023-12-24 12:22:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:22:19,427 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2023-12-24 12:22:19,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:22:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2023-12-24 12:22:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-24 12:22:19,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:22:19,429 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:22:19,439 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-24 12:22:19,635 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-24 12:22:19,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:22:19,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:22:19,636 INFO L85 PathProgramCache]: Analyzing trace with hash -718867702, now seen corresponding path program 1 times [2023-12-24 12:22:19,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:22:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651690783] [2023-12-24 12:22:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:22:19,637 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-24 12:22:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:22:19,639 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-24 12:22:19,640 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-24 12:22:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:22:19,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 12:22:19,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:22:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:22:33,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:22:33,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:22:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651690783] [2023-12-24 12:22:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651690783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:22:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:22:33,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 12:22:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954837293] [2023-12-24 12:22:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:22:33,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 12:22:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:22:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 12:22:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-24 12:22:33,539 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:22:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:22:37,040 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2023-12-24 12:22:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 12:22:37,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2023-12-24 12:22:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:22:37,045 INFO L225 Difference]: With dead ends: 71 [2023-12-24 12:22:37,045 INFO L226 Difference]: Without dead ends: 69 [2023-12-24 12:22:37,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-24 12:22:37,047 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:22:37,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 144 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-24 12:22:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-24 12:22:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2023-12-24 12:22:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:22:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-12-24 12:22:37,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 94 [2023-12-24 12:22:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:22:37,062 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-12-24 12:22:37,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:22:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-12-24 12:22:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-24 12:22:37,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:22:37,064 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:22:37,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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 12:22:37,268 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-24 12:22:37,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:22:37,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:22:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1120856753, now seen corresponding path program 1 times [2023-12-24 12:22:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:22:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408531530] [2023-12-24 12:22:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:22:37,270 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-24 12:22:37,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:22:37,271 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-24 12:22:37,279 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-24 12:22:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:22:37,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 12:22:37,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:22:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:22:48,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:22:48,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:22:48,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408531530] [2023-12-24 12:22:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408531530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:22:48,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:22:48,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 12:22:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477947184] [2023-12-24 12:22:48,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:22:48,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 12:22:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:22:48,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 12:22:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-24 12:22:48,529 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:22:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:22:55,967 INFO L93 Difference]: Finished difference Result 84 states and 118 transitions. [2023-12-24 12:22:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 12:22:55,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2023-12-24 12:22:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:22:55,977 INFO L225 Difference]: With dead ends: 84 [2023-12-24 12:22:55,977 INFO L226 Difference]: Without dead ends: 82 [2023-12-24 12:22:55,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-12-24 12:22:55,978 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 136 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-24 12:22:55,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 160 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-24 12:22:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-24 12:22:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2023-12-24 12:22:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:22:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2023-12-24 12:22:55,988 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 94 [2023-12-24 12:22:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:22:55,989 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2023-12-24 12:22:55,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:22:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2023-12-24 12:22:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-24 12:22:55,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:22:55,991 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:22:55,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 12:22:56,196 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-24 12:22:56,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:22:56,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:22:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 664514775, now seen corresponding path program 1 times [2023-12-24 12:22:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:22:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814009973] [2023-12-24 12:22:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:22:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:22:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:22:56,199 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-24 12:22:56,202 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-24 12:22:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:22:56,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:22:56,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:23:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:23:01,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:23:01,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:23:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814009973] [2023-12-24 12:23:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814009973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:23:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:23:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 12:23:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977022266] [2023-12-24 12:23:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:23:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 12:23:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:23:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 12:23:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-24 12:23:01,593 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:23:09,740 INFO L93 Difference]: Finished difference Result 159 states and 229 transitions. [2023-12-24 12:23:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 12:23:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2023-12-24 12:23:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:23:09,747 INFO L225 Difference]: With dead ends: 159 [2023-12-24 12:23:09,747 INFO L226 Difference]: Without dead ends: 101 [2023-12-24 12:23:09,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2023-12-24 12:23:09,749 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 136 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-24 12:23:09,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 190 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-24 12:23:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-24 12:23:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2023-12-24 12:23:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:23:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2023-12-24 12:23:09,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 95 [2023-12-24 12:23:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:23:09,759 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2023-12-24 12:23:09,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2023-12-24 12:23:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-24 12:23:09,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:23:09,763 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:23:09,771 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 (6)] Ended with exit code 0 [2023-12-24 12:23:09,968 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-24 12:23:09,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:23:09,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:23:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -144831851, now seen corresponding path program 1 times [2023-12-24 12:23:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:23:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110691271] [2023-12-24 12:23:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:23:09,969 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-24 12:23:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:23:09,970 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-24 12:23:09,972 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-24 12:23:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:23:10,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:23:10,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:23:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:23:15,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:23:15,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:23:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110691271] [2023-12-24 12:23:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110691271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:23:15,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:23:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 12:23:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170528171] [2023-12-24 12:23:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:23:15,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 12:23:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:23:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 12:23:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-24 12:23:15,506 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:23:23,141 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2023-12-24 12:23:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 12:23:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2023-12-24 12:23:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:23:23,148 INFO L225 Difference]: With dead ends: 109 [2023-12-24 12:23:23,148 INFO L226 Difference]: Without dead ends: 107 [2023-12-24 12:23:23,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2023-12-24 12:23:23,149 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 128 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-24 12:23:23,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 200 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-24 12:23:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-24 12:23:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2023-12-24 12:23:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:23:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2023-12-24 12:23:23,158 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 95 [2023-12-24 12:23:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:23:23,159 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2023-12-24 12:23:23,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2023-12-24 12:23:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-24 12:23:23,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:23:23,160 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:23:23,166 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-24 12:23:23,365 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-24 12:23:23,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:23:23,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:23:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash 942386743, now seen corresponding path program 1 times [2023-12-24 12:23:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:23:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202835407] [2023-12-24 12:23:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:23:23,367 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-24 12:23:23,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:23:23,368 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-24 12:23:23,369 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-24 12:23:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:23:23,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:23:23,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:23:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:23:30,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:23:30,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:23:30,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202835407] [2023-12-24 12:23:30,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202835407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:23:30,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:23:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 12:23:30,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345532186] [2023-12-24 12:23:30,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:23:30,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 12:23:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:23:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 12:23:30,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 12:23:30,795 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:23:35,266 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2023-12-24 12:23:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 12:23:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2023-12-24 12:23:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:23:35,270 INFO L225 Difference]: With dead ends: 88 [2023-12-24 12:23:35,270 INFO L226 Difference]: Without dead ends: 86 [2023-12-24 12:23:35,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-24 12:23:35,271 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 100 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:23:35,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 162 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-24 12:23:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-24 12:23:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2023-12-24 12:23:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:23:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2023-12-24 12:23:35,282 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 95 [2023-12-24 12:23:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:23:35,283 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2023-12-24 12:23:35,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2023-12-24 12:23:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-24 12:23:35,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:23:35,284 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:23:35,296 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-24 12:23:35,484 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-24 12:23:35,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:23:35,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:23:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 454329263, now seen corresponding path program 1 times [2023-12-24 12:23:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:23:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592988227] [2023-12-24 12:23:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:23:35,486 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-24 12:23:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:23:35,487 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-24 12:23:35,488 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-24 12:23:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:23:35,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:23:35,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:23:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:23:39,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:23:39,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:23:39,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592988227] [2023-12-24 12:23:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592988227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:23:39,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:23:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 12:23:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708606279] [2023-12-24 12:23:39,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:23:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 12:23:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:23:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 12:23:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-24 12:23:39,315 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:23:44,632 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2023-12-24 12:23:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 12:23:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2023-12-24 12:23:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:23:44,635 INFO L225 Difference]: With dead ends: 99 [2023-12-24 12:23:44,635 INFO L226 Difference]: Without dead ends: 97 [2023-12-24 12:23:44,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2023-12-24 12:23:44,636 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 119 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-24 12:23:44,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 176 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-24 12:23:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-24 12:23:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2023-12-24 12:23:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 12:23:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2023-12-24 12:23:44,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 96 [2023-12-24 12:23:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:23:44,644 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2023-12-24 12:23:44,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2023-12-24 12:23:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-24 12:23:44,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:23:44,646 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:23:44,651 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-24 12:23:44,854 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-24 12:23:44,855 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:23:44,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:23:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1134387633, now seen corresponding path program 1 times [2023-12-24 12:23:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:23:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832816014] [2023-12-24 12:23:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:23:44,856 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-24 12:23:44,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:23:44,857 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-24 12:23:44,859 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-24 12:23:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:23:44,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:23:44,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:23:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 12:23:49,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:23:49,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:23:49,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832816014] [2023-12-24 12:23:49,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832816014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:23:49,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:23:49,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 12:23:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718239710] [2023-12-24 12:23:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:23:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 12:23:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:23:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 12:23:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-24 12:23:49,068 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:23:53,610 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2023-12-24 12:23:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 12:23:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2023-12-24 12:23:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:23:53,613 INFO L225 Difference]: With dead ends: 91 [2023-12-24 12:23:53,613 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 12:23:53,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2023-12-24 12:23:53,614 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 110 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-24 12:23:53,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 170 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-24 12:23:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 12:23:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 12:23:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 12:23:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 12:23:53,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-24 12:23:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:23:53,615 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 12:23:53,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 12:23:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 12:23:53,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 12:23:53,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 12:23:53,628 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-24 12:23:53,828 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-24 12:23:53,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 12:23:54,656 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 72) no Hoare annotation was computed. [2023-12-24 12:23:54,656 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,657 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,657 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 56) no Hoare annotation was computed. [2023-12-24 12:23:54,657 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 12:23:54,657 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 12:23:54,657 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 12:23:54,657 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 12:23:54,657 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 48) no Hoare annotation was computed. [2023-12-24 12:23:54,657 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,658 INFO L895 garLoopResultBuilder]: At program point L94-1(line 94) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,658 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 69) no Hoare annotation was computed. [2023-12-24 12:23:54,658 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-24 12:23:54,658 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-24 12:23:54,658 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-12-24 12:23:54,658 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,658 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,659 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 12:23:54,659 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,659 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,659 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-24 12:23:54,659 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-12-24 12:23:54,659 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 12:23:54,659 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 74 98) no Hoare annotation was computed. [2023-12-24 12:23:54,659 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-12-24 12:23:54,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 12:23:54,660 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,660 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 12:23:54,660 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,660 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,660 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-24 12:23:54,660 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-12-24 12:23:54,660 INFO L895 garLoopResultBuilder]: At program point L108-2(lines 108 114) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,661 INFO L899 garLoopResultBuilder]: For program point L108-3(lines 108 114) no Hoare annotation was computed. [2023-12-24 12:23:54,661 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 36 48) no Hoare annotation was computed. [2023-12-24 12:23:54,661 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2023-12-24 12:23:54,661 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 57) no Hoare annotation was computed. [2023-12-24 12:23:54,661 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 57) no Hoare annotation was computed. [2023-12-24 12:23:54,661 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,661 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 12:23:54,661 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 73) no Hoare annotation was computed. [2023-12-24 12:23:54,661 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 12:23:54,662 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 12:23:54,662 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 12:23:54,662 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 12:23:54,664 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 12:23:54,666 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 12:23:54,676 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 12:23:54,677 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 12:23:54,677 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 12:23:54,677 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 12:23:54,677 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 12:23:54,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 12:23:54 BoogieIcfgContainer [2023-12-24 12:23:54,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 12:23:54,679 INFO L158 Benchmark]: Toolchain (without parser) took 129278.95ms. Allocated memory was 212.9MB in the beginning and 877.7MB in the end (delta: 664.8MB). Free memory was 168.4MB in the beginning and 443.6MB in the end (delta: -275.2MB). Peak memory consumption was 391.1MB. Max. memory is 8.0GB. [2023-12-24 12:23:54,679 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 212.9MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 12:23:54,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.42ms. Allocated memory is still 212.9MB. Free memory was 168.0MB in the beginning and 155.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 12:23:54,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.05ms. Allocated memory is still 212.9MB. Free memory was 155.1MB in the beginning and 153.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 12:23:54,679 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 212.9MB. Free memory was 153.0MB in the beginning and 150.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 12:23:54,680 INFO L158 Benchmark]: RCFGBuilder took 567.15ms. Allocated memory is still 212.9MB. Free memory was 150.5MB in the beginning and 132.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 12:23:54,680 INFO L158 Benchmark]: TraceAbstraction took 128352.27ms. Allocated memory was 212.9MB in the beginning and 877.7MB in the end (delta: 664.8MB). Free memory was 131.3MB in the beginning and 443.6MB in the end (delta: -312.3MB). Peak memory consumption was 353.4MB. Max. memory is 8.0GB. [2023-12-24 12:23:54,681 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.51ms. Allocated memory is still 212.9MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.42ms. Allocated memory is still 212.9MB. Free memory was 168.0MB in the beginning and 155.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.05ms. Allocated memory is still 212.9MB. Free memory was 155.1MB in the beginning and 153.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 212.9MB. Free memory was 153.0MB in the beginning and 150.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 567.15ms. Allocated memory is still 212.9MB. Free memory was 150.5MB in the beginning and 132.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 128352.27ms. Allocated memory was 212.9MB in the beginning and 877.7MB in the end (delta: 664.8MB). Free memory was 131.3MB in the beginning and 443.6MB in the end (delta: -312.3MB). Peak memory consumption was 353.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 128.3s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 49.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 28.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 968 mSDsluCounter, 1396 SdHoareTripleChecker+Invalid, 25.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 984 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3265 IncrementalHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 412 mSDtfsCounter, 3265 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, InterpolantAutomatonStates: 124, 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, 9 MinimizatonAttempts, 184 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 61 PreInvPairs, 81 NumberOfFragments, 559 HoareAnnotationTreeSize, 61 FormulaSimplifications, 7136627 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 17 FormulaSimplificationsInter, 22749 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 75.1s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 5897 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1408 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 12:23:54,727 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...