/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-59.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:17:16,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:17:16,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 23:17:16,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:17:16,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:17:16,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:17:16,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:17:16,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:17:16,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:17:16,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:17:16,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:17:16,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:17:16,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:17:16,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:17:16,256 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:17:16,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:17:16,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:17:16,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:17:16,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:17:16,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:17:16,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:17:16,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:17:16,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:17:16,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:17:16,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:17:16,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:17:16,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:17:16,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:17:16,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:17:16,263 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:17:16,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:17:16,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:17:16,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:17:16,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:17:16,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:17:16,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:17:16,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:17:16,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:17:16,266 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:17:16,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:17:16,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:17:16,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:17:16,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:17:16,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:17:16,267 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:17:16,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:17:16,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:17:16,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:17:16,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:17:16,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:17:16,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-59.i [2024-11-05 23:17:17,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:17:18,119 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:17:18,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-59.i [2024-11-05 23:17:18,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f94c7a6a/54943cd2146147078bf3c63e60af167b/FLAG2babfabfa [2024-11-05 23:17:18,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f94c7a6a/54943cd2146147078bf3c63e60af167b [2024-11-05 23:17:18,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:17:18,149 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:17:18,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:17:18,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:17:18,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:17:18,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c380382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18, skipping insertion in model container [2024-11-05 23:17:18,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:17:18,369 WARN L250 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_operatoramount_amount10_file-59.i[915,928] [2024-11-05 23:17:18,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:17:18,410 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:17:18,425 WARN L250 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_operatoramount_amount10_file-59.i[915,928] [2024-11-05 23:17:18,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:17:18,451 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:17:18,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18 WrapperNode [2024-11-05 23:17:18,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:17:18,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:17:18,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:17:18,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:17:18,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,494 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 61 [2024-11-05 23:17:18,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:17:18,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:17:18,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:17:18,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:17:18,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,516 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]. [2024-11-05 23:17:18,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:17:18,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:17:18,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:17:18,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:17:18,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (1/1) ... [2024-11-05 23:17:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:17:18,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:17:18,566 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) [2024-11-05 23:17:18,568 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 [2024-11-05 23:17:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:17:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:17:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:17:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:17:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:17:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:17:18,661 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:17:18,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:17:18,865 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-05 23:17:18,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:17:18,877 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:17:18,877 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:17:18,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:17:18 BoogieIcfgContainer [2024-11-05 23:17:18,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:17:18,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:17:18,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:17:18,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:17:18,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:17:18" (1/3) ... [2024-11-05 23:17:18,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506ff2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:17:18, skipping insertion in model container [2024-11-05 23:17:18,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:18" (2/3) ... [2024-11-05 23:17:18,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506ff2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:17:18, skipping insertion in model container [2024-11-05 23:17:18,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:17:18" (3/3) ... [2024-11-05 23:17:18,885 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-59.i [2024-11-05 23:17:18,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:17:18,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:17:18,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:17:18,979 INFO L333 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, 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;@7e19ef2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:17:18,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:17:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-05 23:17:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 23:17:18,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:18,991 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:18,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:18,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:18,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2027417680, now seen corresponding path program 1 times [2024-11-05 23:17:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094550494] [2024-11-05 23:17:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:19,012 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 [2024-11-05 23:17:19,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:19,016 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) [2024-11-05 23:17:19,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 23:17:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:19,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:17:19,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 23:17:19,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:19,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094550494] [2024-11-05 23:17:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094550494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:17:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614022983] [2024-11-05 23:17:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:17:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:17:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:17:19,197 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 23:17:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:19,217 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2024-11-05 23:17:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:17:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-05 23:17:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:19,224 INFO L225 Difference]: With dead ends: 57 [2024-11-05 23:17:19,225 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 23:17:19,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:17:19,230 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:19,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:17:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 23:17:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-05 23:17:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-05 23:17:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-05 23:17:19,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 48 [2024-11-05 23:17:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-05 23:17:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 23:17:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-05 23:17:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 23:17:19,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:19,272 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 23:17:19,473 WARN L453 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 [2024-11-05 23:17:19,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:19,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 440007794, now seen corresponding path program 1 times [2024-11-05 23:17:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:19,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569514128] [2024-11-05 23:17:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:19,476 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 [2024-11-05 23:17:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:19,478 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) [2024-11-05 23:17:19,480 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 [2024-11-05 23:17:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:19,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:17:19,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-05 23:17:20,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:20,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569514128] [2024-11-05 23:17:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569514128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-05 23:17:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897639600] [2024-11-05 23:17:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:20,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 23:17:20,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 23:17:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 23:17:20,753 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 23:17:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:21,181 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-05 23:17:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 23:17:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 48 [2024-11-05 23:17:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:21,185 INFO L225 Difference]: With dead ends: 36 [2024-11-05 23:17:21,185 INFO L226 Difference]: Without dead ends: 34 [2024-11-05 23:17:21,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:17:21,187 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:21,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:17:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-05 23:17:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-05 23:17:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-05 23:17:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-11-05 23:17:21,198 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 48 [2024-11-05 23:17:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-05 23:17:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 23:17:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-05 23:17:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-05 23:17:21,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:21,201 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:21,208 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 (3)] Ended with exit code 0 [2024-11-05 23:17:21,401 WARN L453 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 [2024-11-05 23:17:21,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash 372016035, now seen corresponding path program 1 times [2024-11-05 23:17:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:21,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103694971] [2024-11-05 23:17:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:21,404 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 [2024-11-05 23:17:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:21,410 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) [2024-11-05 23:17:21,411 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 [2024-11-05 23:17:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:21,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 23:17:21,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-05 23:17:22,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:22,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103694971] [2024-11-05 23:17:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103694971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 23:17:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568539690] [2024-11-05 23:17:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:17:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:17:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:17:22,013 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 23:17:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:22,580 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2024-11-05 23:17:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:17:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 49 [2024-11-05 23:17:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:22,584 INFO L225 Difference]: With dead ends: 68 [2024-11-05 23:17:22,584 INFO L226 Difference]: Without dead ends: 40 [2024-11-05 23:17:22,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:17:22,586 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:22,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 124 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 23:17:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-05 23:17:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2024-11-05 23:17:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-05 23:17:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-05 23:17:22,591 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 49 [2024-11-05 23:17:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:22,592 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-05 23:17:22,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 23:17:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-05 23:17:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 23:17:22,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:22,593 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:22,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 23:17:22,794 WARN L453 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 [2024-11-05 23:17:22,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1301673624, now seen corresponding path program 1 times [2024-11-05 23:17:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295912725] [2024-11-05 23:17:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:22,796 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 [2024-11-05 23:17:22,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:22,799 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) [2024-11-05 23:17:22,800 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 [2024-11-05 23:17:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:22,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 23:17:22,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-05 23:17:23,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:23,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295912725] [2024-11-05 23:17:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295912725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:23,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-05 23:17:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797047585] [2024-11-05 23:17:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:23,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:17:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:17:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:17:23,327 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 23:17:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:23,952 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-05 23:17:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 23:17:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 50 [2024-11-05 23:17:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:23,954 INFO L225 Difference]: With dead ends: 40 [2024-11-05 23:17:23,954 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 23:17:23,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:23,956 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:23,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 23:17:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 23:17:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 23:17:23,957 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) [2024-11-05 23:17:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 23:17:23,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-05 23:17:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:23,958 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 23:17:23,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-05 23:17:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 23:17:23,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 23:17:23,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 23:17:23,967 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 [2024-11-05 23:17:24,161 WARN L453 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 [2024-11-05 23:17:24,164 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-05 23:17:24,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 23:17:24,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 23:17:24,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 11:17:24 BoogieIcfgContainer [2024-11-05 23:17:24,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 23:17:24,197 INFO L158 Benchmark]: Toolchain (without parser) took 6048.13ms. Allocated memory was 194.0MB in the beginning and 242.2MB in the end (delta: 48.2MB). Free memory was 152.4MB in the beginning and 122.5MB in the end (delta: 30.0MB). Peak memory consumption was 79.1MB. Max. memory is 8.0GB. [2024-11-05 23:17:24,197 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 194.0MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 23:17:24,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.83ms. Allocated memory is still 194.0MB. Free memory was 152.0MB in the beginning and 138.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 23:17:24,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.89ms. Allocated memory is still 194.0MB. Free memory was 138.8MB in the beginning and 137.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-05 23:17:24,198 INFO L158 Benchmark]: Boogie Preprocessor took 37.34ms. Allocated memory is still 194.0MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:17:24,198 INFO L158 Benchmark]: RCFGBuilder took 344.29ms. Allocated memory is still 194.0MB. Free memory was 135.0MB in the beginning and 123.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-05 23:17:24,199 INFO L158 Benchmark]: TraceAbstraction took 5316.96ms. Allocated memory was 194.0MB in the beginning and 242.2MB in the end (delta: 48.2MB). Free memory was 122.0MB in the beginning and 122.5MB in the end (delta: -430.0kB). Peak memory consumption was 48.7MB. Max. memory is 8.0GB. [2024-11-05 23:17:24,201 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.86ms. Allocated memory is still 194.0MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.83ms. Allocated memory is still 194.0MB. Free memory was 152.0MB in the beginning and 138.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.89ms. Allocated memory is still 194.0MB. Free memory was 138.8MB in the beginning and 137.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.34ms. Allocated memory is still 194.0MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 344.29ms. Allocated memory is still 194.0MB. Free memory was 135.0MB in the beginning and 123.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5316.96ms. Allocated memory was 194.0MB in the beginning and 242.2MB in the end (delta: 48.2MB). Free memory was 122.0MB in the beginning and 122.5MB in the end (delta: -430.0kB). Peak memory consumption was 48.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 148 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 12 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 336/336 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: 64]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) RESULT: Ultimate proved your program to be correct! [2024-11-05 23:17:24,231 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...