/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.arbitrated_top_n2_w16_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 16:26:33,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 16:26:33,868 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-01 16:26:33,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 16:26:33,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 16:26:33,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 16:26:33,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 16:26:33,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 16:26:33,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 16:26:33,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 16:26:33,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 16:26:33,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 16:26:33,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 16:26:33,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 16:26:33,911 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 16:26:33,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 16:26:33,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 16:26:33,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 16:26:33,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 16:26:33,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 16:26:33,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 16:26:33,918 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 16:26:33,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 16:26:33,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 16:26:33,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 16:26:33,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 16:26:33,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 16:26:33,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 16:26:33,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 16:26:33,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 16:26:33,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 16:26:33,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 16:26:33,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 16:26:33,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 16:26:33,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 16:26:33,923 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 16:26:33,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 16:26:33,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 16:26:33,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 16:26:33,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 16:26:33,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 16:26:33,924 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 16:26:33,925 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-01 16:26:34,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 16:26:34,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 16:26:34,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 16:26:34,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 16:26:34,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 16:26:34,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w16_d8_e0.c [2024-11-01 16:26:35,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 16:26:36,037 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 16:26:36,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w16_d8_e0.c [2024-11-01 16:26:36,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a164bcf10/7b2d2d9c30704b1b8aa87c7d1a70ea2b/FLAG2dbf08e7a [2024-11-01 16:26:36,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a164bcf10/7b2d2d9c30704b1b8aa87c7d1a70ea2b [2024-11-01 16:26:36,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 16:26:36,068 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 16:26:36,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 16:26:36,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 16:26:36,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 16:26:36,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48574c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36, skipping insertion in model container [2024-11-01 16:26:36,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 16:26:36,343 WARN L251 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.arbitrated_top_n2_w16_d8_e0.c[1270,1283] [2024-11-01 16:26:36,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 16:26:36,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 16:26:36,659 WARN L251 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.arbitrated_top_n2_w16_d8_e0.c[1270,1283] [2024-11-01 16:26:36,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 16:26:36,789 INFO L204 MainTranslator]: Completed translation [2024-11-01 16:26:36,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36 WrapperNode [2024-11-01 16:26:36,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 16:26:36,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 16:26:36,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 16:26:36,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 16:26:36,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,936 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1207 [2024-11-01 16:26:36,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 16:26:36,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 16:26:36,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 16:26:36,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 16:26:36,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,995 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-01 16:26:36,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:36,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:37,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:37,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:37,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:37,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:37,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 16:26:37,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 16:26:37,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 16:26:37,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 16:26:37,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (1/1) ... [2024-11-01 16:26:37,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 16:26:37,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 16:26:37,122 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-01 16:26:37,126 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-01 16:26:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 16:26:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 16:26:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-01 16:26:37,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-01 16:26:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 16:26:37,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 16:26:37,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 16:26:37,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 16:26:38,365 INFO L? ?]: Removed 425 outVars from TransFormulas that were not future-live. [2024-11-01 16:26:38,365 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 16:26:38,377 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 16:26:38,378 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 16:26:38,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:26:38 BoogieIcfgContainer [2024-11-01 16:26:38,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 16:26:38,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 16:26:38,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 16:26:38,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 16:26:38,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:26:36" (1/3) ... [2024-11-01 16:26:38,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2c8982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:26:38, skipping insertion in model container [2024-11-01 16:26:38,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:26:36" (2/3) ... [2024-11-01 16:26:38,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2c8982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:26:38, skipping insertion in model container [2024-11-01 16:26:38,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:26:38" (3/3) ... [2024-11-01 16:26:38,387 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n2_w16_d8_e0.c [2024-11-01 16:26:38,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 16:26:38,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 16:26:38,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 16:26:38,463 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;@22aa03c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 16:26:38,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 16:26:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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-01 16:26:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-01 16:26:38,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:26:38,477 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] [2024-11-01 16:26:38,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:26:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:26:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1387212075, now seen corresponding path program 1 times [2024-11-01 16:26:38,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:26:38,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376093144] [2024-11-01 16:26:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:26:38,495 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-01 16:26:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:26:38,499 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-01 16:26:38,531 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-01 16:26:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:26:39,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-01 16:26:39,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:26:39,093 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-01 16:26:39,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:26:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-01 16:26:39,159 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:26:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376093144] [2024-11-01 16:26:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [376093144] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-01 16:26:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-01 16:26:39,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-01 16:26:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821864866] [2024-11-01 16:26:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-01 16:26:39,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-01 16:26:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:26:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-01 16:26:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-01 16:26:39,195 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-01 16:26:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:26:39,214 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2024-11-01 16:26:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-01 16:26:39,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 47 [2024-11-01 16:26:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:26:39,222 INFO L225 Difference]: With dead ends: 51 [2024-11-01 16:26:39,222 INFO L226 Difference]: Without dead ends: 25 [2024-11-01 16:26:39,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-01 16:26:39,228 INFO L432 NwaCegarLoop]: 31 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, 31 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-01 16:26:39,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 16:26:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-01 16:26:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-01 16:26:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-01 16:26:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-01 16:26:39,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 47 [2024-11-01 16:26:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:26:39,260 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-01 16:26:39,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-01 16:26:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-01 16:26:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-01 16:26:39,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:26:39,263 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] [2024-11-01 16:26:39,269 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-01 16:26:39,463 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-01 16:26:39,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:26:39,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:26:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash 971432711, now seen corresponding path program 1 times [2024-11-01 16:26:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:26:39,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72586432] [2024-11-01 16:26:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:26:39,465 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-01 16:26:39,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:26:39,467 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-01 16:26:39,467 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-01 16:26:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:26:40,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-01 16:26:40,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:26:40,332 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-01 16:26:40,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:26:40,742 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-01 16:26:40,743 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:26:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72586432] [2024-11-01 16:26:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [72586432] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 16:26:40,744 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 16:26:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 16:26:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621893798] [2024-11-01 16:26:40,745 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 16:26:40,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 16:26:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:26:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 16:26:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 16:26:40,748 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-01 16:26:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:26:40,937 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-11-01 16:26:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 16:26:40,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 47 [2024-11-01 16:26:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:26:40,940 INFO L225 Difference]: With dead ends: 43 [2024-11-01 16:26:40,940 INFO L226 Difference]: Without dead ends: 41 [2024-11-01 16:26:40,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 16:26:40,941 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-01 16:26:40,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-01 16:26:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-01 16:26:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-01 16:26:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-01 16:26:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-11-01 16:26:40,960 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 47 [2024-11-01 16:26:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:26:40,962 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-11-01 16:26:40,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-01 16:26:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-11-01 16:26:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-01 16:26:40,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:26:40,967 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-01 16:26:40,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-01 16:26:41,167 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-01 16:26:41,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:26:41,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:26:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 815302051, now seen corresponding path program 1 times [2024-11-01 16:26:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:26:41,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1490946749] [2024-11-01 16:26:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:26:41,170 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-01 16:26:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:26:41,173 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-01 16:26:41,174 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-01 16:26:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:26:42,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-01 16:26:42,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:26:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-01 16:26:43,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:26:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-01 16:26:48,346 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:26:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1490946749] [2024-11-01 16:26:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1490946749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 16:26:48,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 16:26:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-01 16:26:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472846859] [2024-11-01 16:26:48,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 16:26:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-01 16:26:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:26:48,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-01 16:26:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-01 16:26:48,350 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-01 16:26:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:26:48,990 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-01 16:26:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-01 16:26:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 92 [2024-11-01 16:26:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:26:48,992 INFO L225 Difference]: With dead ends: 60 [2024-11-01 16:26:48,992 INFO L226 Difference]: Without dead ends: 58 [2024-11-01 16:26:48,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-01 16:26:48,994 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-01 16:26:48,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 124 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-01 16:26:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-01 16:26:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-01 16:26:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-01 16:26:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-01 16:26:49,008 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 92 [2024-11-01 16:26:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:26:49,009 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-01 16:26:49,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-01 16:26:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-01 16:26:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-01 16:26:49,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:26:49,011 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-01 16:26:49,020 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-01 16:26:49,212 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-01 16:26:49,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:26:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:26:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1845464953, now seen corresponding path program 2 times [2024-11-01 16:26:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:26:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030959612] [2024-11-01 16:26:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:26:49,214 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-01 16:26:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:26:49,216 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-01 16:26:49,217 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-01 16:26:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:26:52,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-01 16:26:52,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:27:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-01 16:27:13,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:27:19,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_138~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse10 (= |c_ULTIMATE.start_main_~state_194~0#1| (_ bv0 8))) (.cse11 (forall ((|v_ULTIMATE.start_main_~var_217_arg_0~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_214_arg_1~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_214_arg_1~0#1_17|)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_217_arg_0~0#1_18|)))) .cse5)) (_ bv0 8)))) (.cse12 (= (_ bv0 32) .cse7))) (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_134~0#1|)) (.cse9 (or .cse10 .cse11 (not .cse12)))) (let ((.cse3 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_10~0#1|)) (.cse0 (and .cse9 (or .cse10 .cse12 .cse11))) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_57~0#1|)) (.cse2 (and .cse9 (or (and (or .cse10 .cse11) (or (not .cse10) (forall ((|v_ULTIMATE.start_main_~var_217_arg_0~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_156_arg_1~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_137_arg_1~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_137_arg_1~0#1_16|) .cse8)))))) (_ bv255 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_156_arg_1~0#1_17|))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_217_arg_0~0#1_18|)))))) (_ bv0 8))))) .cse12)))) (and (or (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_149_arg_1~0#1_17| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_149_arg_1~0#1_17|))) .cse1))) (_ bv0 32)))) (or (forall ((|v_ULTIMATE.start_main_~var_149_arg_1~0#1_17| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_149_arg_1~0#1_17|))) .cse1))) (_ bv0 32)))) .cse2)) .cse3) (or (not .cse3) (let ((.cse4 (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_113~0#1|) .cse5))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse8))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_143_arg_0~0#1_16| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_143_arg_0~0#1_16|) .cse6)))))) .cse7)))))))) .cse1))) (_ bv0 32)))) (or (forall ((|v_ULTIMATE.start_main_~var_143_arg_0~0#1_16| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_143_arg_0~0#1_16|) .cse6)))))) .cse7)))))))) .cse1))) (_ bv0 32)))) .cse2))))))))) is different from false [2024-11-01 16:27:59,384 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-01 16:27:59,385 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:27:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030959612] [2024-11-01 16:27:59,386 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-01 16:27:59,388 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-01 16:27:59,402 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-01 16:27:59,586 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-01 16:27:59,587 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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) 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) ... 44 more [2024-11-01 16:27:59,591 INFO L158 Benchmark]: Toolchain (without parser) took 83522.57ms. Allocated memory was 204.5MB in the beginning and 744.5MB in the end (delta: 540.0MB). Free memory was 178.2MB in the beginning and 522.0MB in the end (delta: -343.9MB). Peak memory consumption was 197.5MB. Max. memory is 8.0GB. [2024-11-01 16:27:59,591 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 180.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 16:27:59,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.87ms. Allocated memory is still 204.5MB. Free memory was 177.9MB in the beginning and 132.3MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2024-11-01 16:27:59,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.39ms. Allocated memory is still 204.5MB. Free memory was 132.3MB in the beginning and 122.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-11-01 16:27:59,592 INFO L158 Benchmark]: Boogie Preprocessor took 143.86ms. Allocated memory is still 204.5MB. Free memory was 122.9MB in the beginning and 111.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-01 16:27:59,592 INFO L158 Benchmark]: RCFGBuilder took 1297.54ms. Allocated memory was 204.5MB in the beginning and 264.2MB in the end (delta: 59.8MB). Free memory was 111.3MB in the beginning and 111.2MB in the end (delta: 134.9kB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2024-11-01 16:27:59,593 INFO L158 Benchmark]: TraceAbstraction took 81209.31ms. Allocated memory was 264.2MB in the beginning and 744.5MB in the end (delta: 480.2MB). Free memory was 110.1MB in the beginning and 522.0MB in the end (delta: -411.9MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2024-11-01 16:27:59,594 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.12ms. Allocated memory is still 204.5MB. Free memory is still 180.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 720.87ms. Allocated memory is still 204.5MB. Free memory was 177.9MB in the beginning and 132.3MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 145.39ms. Allocated memory is still 204.5MB. Free memory was 132.3MB in the beginning and 122.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 143.86ms. Allocated memory is still 204.5MB. Free memory was 122.9MB in the beginning and 111.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1297.54ms. Allocated memory was 204.5MB in the beginning and 264.2MB in the end (delta: 59.8MB). Free memory was 111.3MB in the beginning and 111.2MB in the end (delta: 134.9kB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. * TraceAbstraction took 81209.31ms. Allocated memory was 264.2MB in the beginning and 744.5MB in the end (delta: 480.2MB). Free memory was 110.1MB in the beginning and 522.0MB in the end (delta: -411.9MB). Peak memory consumption was 69.9MB. 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...