/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 09:18:12,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 09:18:12,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 09:18:12,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 09:18:12,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 09:18:12,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 09:18:12,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 09:18:12,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 09:18:12,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 09:18:12,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 09:18:12,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 09:18:12,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 09:18:12,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 09:18:12,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 09:18:12,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 09:18:12,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 09:18:12,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 09:18:12,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 09:18:12,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 09:18:12,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 09:18:12,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 09:18:12,357 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 09:18:12,357 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 09:18:12,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 09:18:12,357 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 09:18:12,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 09:18:12,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 09:18:12,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 09:18:12,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 09:18:12,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 09:18:12,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 09:18:12,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:18:12,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 09:18:12,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 09:18:12,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 09:18:12,360 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 09:18:12,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 09:18:12,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 09:18:12,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 09:18:12,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 09:18:12,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 09:18:12,363 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -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 09:18:12,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 09:18:12,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 09:18:12,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 09:18:12,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 09:18:12,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 09:18:12,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-11-05 09:18:14,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 09:18:14,357 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 09:18:14,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-11-05 09:18:14,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519a3ea98/78196c6302f24122834d7910558d6b60/FLAG617f2aafe [2024-11-05 09:18:14,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519a3ea98/78196c6302f24122834d7910558d6b60 [2024-11-05 09:18:14,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 09:18:14,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 09:18:14,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 09:18:14,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 09:18:14,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 09:18:14,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:18:14" (1/1) ... [2024-11-05 09:18:14,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633fc300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:14, skipping insertion in model container [2024-11-05 09:18:14,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:18:14" (1/1) ... [2024-11-05 09:18:14,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 09:18:14,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2024-11-05 09:18:14,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:18:14,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 09:18:14,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2024-11-05 09:18:15,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:18:15,129 INFO L204 MainTranslator]: Completed translation [2024-11-05 09:18:15,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15 WrapperNode [2024-11-05 09:18:15,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 09:18:15,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 09:18:15,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 09:18:15,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 09:18:15,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,251 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1459 [2024-11-05 09:18:15,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 09:18:15,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 09:18:15,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 09:18:15,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 09:18:15,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,329 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 09:18:15,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 09:18:15,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 09:18:15,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 09:18:15,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 09:18:15,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (1/1) ... [2024-11-05 09:18:15,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:18:15,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 09:18:15,459 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 09:18:15,464 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 09:18:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 09:18:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 09:18:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 09:18:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 09:18:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 09:18:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 09:18:15,756 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 09:18:15,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 09:18:16,937 INFO L? ?]: Removed 416 outVars from TransFormulas that were not future-live. [2024-11-05 09:18:16,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 09:18:16,948 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 09:18:16,949 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 09:18:16,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:18:16 BoogieIcfgContainer [2024-11-05 09:18:16,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 09:18:16,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 09:18:16,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 09:18:16,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 09:18:16,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 09:18:14" (1/3) ... [2024-11-05 09:18:16,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58940289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:18:16, skipping insertion in model container [2024-11-05 09:18:16,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:18:15" (2/3) ... [2024-11-05 09:18:16,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58940289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:18:16, skipping insertion in model container [2024-11-05 09:18:16,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:18:16" (3/3) ... [2024-11-05 09:18:16,957 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-11-05 09:18:16,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 09:18:16,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 09:18:17,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 09:18:17,034 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;@38dc812b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 09:18:17,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 09:18:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-05 09:18:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-05 09:18:17,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:18:17,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 09:18:17,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:18:17,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:18:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1944675641, now seen corresponding path program 1 times [2024-11-05 09:18:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:18:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410020434] [2024-11-05 09:18:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:18:17,053 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 09:18:17,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:18:17,055 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 09:18:17,056 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 09:18:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:18:17,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 09:18:17,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:18:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 09:18:17,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:18:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 09:18:17,653 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:18:17,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410020434] [2024-11-05 09:18:17,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [410020434] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 09:18:17,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 09:18:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 09:18:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239831450] [2024-11-05 09:18:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 09:18:17,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 09:18:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:18:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 09:18:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 09:18:17,678 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 09:18:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:18:17,692 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-11-05 09:18:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 09:18:17,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-05 09:18:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:18:17,700 INFO L225 Difference]: With dead ends: 35 [2024-11-05 09:18:17,700 INFO L226 Difference]: Without dead ends: 17 [2024-11-05 09:18:17,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 09:18:17,706 INFO L432 NwaCegarLoop]: 19 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, 19 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 09:18:17,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 09:18:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-05 09:18:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-05 09:18:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-05 09:18:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-05 09:18:17,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-05 09:18:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:18:17,739 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-05 09:18:17,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 09:18:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-05 09:18:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-05 09:18:17,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:18:17,742 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 09:18:17,751 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 09:18:17,945 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 09:18:17,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:18:17,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:18:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 265954675, now seen corresponding path program 1 times [2024-11-05 09:18:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:18:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1709187550] [2024-11-05 09:18:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:18:17,949 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 09:18:17,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:18:17,950 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 09:18:17,952 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 09:18:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:18:18,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 09:18:18,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:18:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 09:18:18,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:18:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 09:18:18,894 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:18:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1709187550] [2024-11-05 09:18:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1709187550] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 09:18:18,894 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 09:18:18,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 09:18:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046593552] [2024-11-05 09:18:18,895 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 09:18:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 09:18:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:18:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 09:18:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:18:18,899 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-05 09:18:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:18:19,103 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-05 09:18:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 09:18:19,104 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 23 [2024-11-05 09:18:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:18:19,105 INFO L225 Difference]: With dead ends: 27 [2024-11-05 09:18:19,105 INFO L226 Difference]: Without dead ends: 25 [2024-11-05 09:18:19,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:18:19,107 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 09:18:19,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 09:18:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-05 09:18:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-05 09:18:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 09:18:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-05 09:18:19,117 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-05 09:18:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:18:19,119 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-05 09:18:19,120 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-05 09:18:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-05 09:18:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 09:18:19,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:18:19,122 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-05 09:18:19,130 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 09:18:19,326 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 09:18:19,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:18:19,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:18:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash 416519459, now seen corresponding path program 1 times [2024-11-05 09:18:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:18:19,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2019873356] [2024-11-05 09:18:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:18:19,328 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 09:18:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:18:19,332 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 09:18:19,333 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 09:18:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:18:20,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-05 09:18:20,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:18:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-05 09:18:21,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:18:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-05 09:18:24,478 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:18:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2019873356] [2024-11-05 09:18:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2019873356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 09:18:24,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 09:18:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-05 09:18:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558943656] [2024-11-05 09:18:24,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 09:18:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 09:18:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:18:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 09:18:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-05 09:18:24,482 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-05 09:18:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:18:25,113 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-05 09:18:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 09:18:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2024-11-05 09:18:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:18:25,115 INFO L225 Difference]: With dead ends: 36 [2024-11-05 09:18:25,115 INFO L226 Difference]: Without dead ends: 34 [2024-11-05 09:18:25,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-05 09:18:25,117 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 09:18:25,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 09:18:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-05 09:18:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-05 09:18:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-05 09:18:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-05 09:18:25,126 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 44 [2024-11-05 09:18:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:18:25,127 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-05 09:18:25,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-05 09:18:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-05 09:18:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 09:18:25,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:18:25,129 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-05 09:18:25,145 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 09:18:25,330 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 09:18:25,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:18:25,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:18:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 223728499, now seen corresponding path program 2 times [2024-11-05 09:18:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:18:25,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232776796] [2024-11-05 09:18:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:18:25,332 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 09:18:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:18:25,335 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 09:18:25,336 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 09:18:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:18:27,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-05 09:18:27,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:18:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-05 09:18:30,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:19:19,907 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-05 09:19:19,908 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:19:19,909 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 101 [2024-11-05 09:19:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232776796] [2024-11-05 09:19:19,909 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-05 09:19:19,927 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 09:19:20,110 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 09:19:20,111 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-05 09:19:20,115 INFO L158 Benchmark]: Toolchain (without parser) took 65720.66ms. Allocated memory was 182.5MB in the beginning and 569.4MB in the end (delta: 386.9MB). Free memory was 133.2MB in the beginning and 320.3MB in the end (delta: -187.1MB). Peak memory consumption was 200.5MB. Max. memory is 8.0GB. [2024-11-05 09:19:20,115 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 129.0MB in the end (delta: 119.6kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 09:19:20,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.43ms. Allocated memory was 182.5MB in the beginning and 296.7MB in the end (delta: 114.3MB). Free memory was 132.9MB in the beginning and 252.6MB in the end (delta: -119.7MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2024-11-05 09:19:20,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.40ms. Allocated memory is still 296.7MB. Free memory was 252.6MB in the beginning and 241.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-05 09:19:20,116 INFO L158 Benchmark]: Boogie Preprocessor took 172.56ms. Allocated memory is still 296.7MB. Free memory was 241.6MB in the beginning and 228.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-05 09:19:20,116 INFO L158 Benchmark]: RCFGBuilder took 1521.68ms. Allocated memory is still 296.7MB. Free memory was 228.3MB in the beginning and 203.9MB in the end (delta: 24.4MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. [2024-11-05 09:19:20,117 INFO L158 Benchmark]: TraceAbstraction took 63162.85ms. Allocated memory was 296.7MB in the beginning and 569.4MB in the end (delta: 272.6MB). Free memory was 202.8MB in the beginning and 320.3MB in the end (delta: -117.5MB). Peak memory consumption was 155.1MB. Max. memory is 8.0GB. [2024-11-05 09:19:20,123 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.14ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 129.0MB in the end (delta: 119.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 732.43ms. Allocated memory was 182.5MB in the beginning and 296.7MB in the end (delta: 114.3MB). Free memory was 132.9MB in the beginning and 252.6MB in the end (delta: -119.7MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 121.40ms. Allocated memory is still 296.7MB. Free memory was 252.6MB in the beginning and 241.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 172.56ms. Allocated memory is still 296.7MB. Free memory was 241.6MB in the beginning and 228.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * RCFGBuilder took 1521.68ms. Allocated memory is still 296.7MB. Free memory was 228.3MB in the beginning and 203.9MB in the end (delta: 24.4MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. * TraceAbstraction took 63162.85ms. Allocated memory was 296.7MB in the beginning and 569.4MB in the end (delta: 272.6MB). Free memory was 202.8MB in the beginning and 320.3MB in the end (delta: -117.5MB). Peak memory consumption was 155.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...