/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.gear.1.prop1-func-interl.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 10:41:32,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 10:41:32,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-26 10:41:32,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 10:41:32,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 10:41:32,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 10:41:32,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 10:41:32,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 10:41:32,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 10:41:32,613 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 10:41:32,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 10:41:32,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 10:41:32,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 10:41:32,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 10:41:32,616 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 10:41:32,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 10:41:32,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 10:41:32,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 10:41:32,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 10:41:32,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 10:41:32,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 10:41:32,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 10:41:32,618 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 10:41:32,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 10:41:32,618 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 10:41:32,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 10:41:32,619 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 10:41:32,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 10:41:32,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 10:41:32,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 10:41:32,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 10:41:32,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 10:41:32,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 10:41:32,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 10:41:32,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 10:41:32,622 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 10:41:32,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 10:41:32,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 10:41:32,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 10:41:32,623 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 10:41:32,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 10:41:32,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 10:41:32,623 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 10:41:32,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-26 10:41:32,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 10:41:32,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 10:41:32,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 10:41:32,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 10:41:32,875 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 10:41:32,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.gear.1.prop1-func-interl.c [2023-12-26 10:41:34,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 10:41:34,504 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 10:41:34,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.gear.1.prop1-func-interl.c [2023-12-26 10:41:34,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb8b4d0d0/cc16a1662d6b419497e46981aefa7fc8/FLAGb288beaf9 [2023-12-26 10:41:34,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb8b4d0d0/cc16a1662d6b419497e46981aefa7fc8 [2023-12-26 10:41:34,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 10:41:34,542 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 10:41:34,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 10:41:34,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 10:41:34,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 10:41:34,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:41:34" (1/1) ... [2023-12-26 10:41:34,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3439a44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:34, skipping insertion in model container [2023-12-26 10:41:34,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:41:34" (1/1) ... [2023-12-26 10:41:34,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 10:41:34,830 WARN L239 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.gear.1.prop1-func-interl.c[1171,1184] [2023-12-26 10:41:35,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 10:41:35,216 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 10:41:35,226 WARN L239 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.gear.1.prop1-func-interl.c[1171,1184] [2023-12-26 10:41:35,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 10:41:35,359 INFO L206 MainTranslator]: Completed translation [2023-12-26 10:41:35,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35 WrapperNode [2023-12-26 10:41:35,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 10:41:35,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 10:41:35,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 10:41:35,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 10:41:35,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,536 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3647 [2023-12-26 10:41:35,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 10:41:35,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 10:41:35,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 10:41:35,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 10:41:35,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-26 10:41:35,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 10:41:35,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 10:41:35,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 10:41:35,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 10:41:35,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (1/1) ... [2023-12-26 10:41:35,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 10:41:35,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 10:41:35,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-26 10:41:35,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-26 10:41:35,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 10:41:35,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 10:41:35,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 10:41:35,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 10:41:36,433 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 10:41:36,434 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 10:41:40,997 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 10:41:41,130 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 10:41:41,131 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 10:41:41,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:41:41 BoogieIcfgContainer [2023-12-26 10:41:41,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 10:41:41,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 10:41:41,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 10:41:41,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 10:41:41,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:41:34" (1/3) ... [2023-12-26 10:41:41,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:41:41, skipping insertion in model container [2023-12-26 10:41:41,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:35" (2/3) ... [2023-12-26 10:41:41,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:41:41, skipping insertion in model container [2023-12-26 10:41:41,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:41:41" (3/3) ... [2023-12-26 10:41:41,139 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.gear.1.prop1-func-interl.c [2023-12-26 10:41:41,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 10:41:41,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 10:41:41,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 10:41:41,197 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b423971, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 10:41:41,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 10:41:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:41:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-26 10:41:41,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 10:41:41,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-26 10:41:41,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 10:41:41,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 10:41:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-26 10:41:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 10:41:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311965418] [2023-12-26 10:41:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 10:41:41,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 10:41:41,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 10:41:41,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 10:41:41,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-26 10:41:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 10:41:41,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-26 10:41:41,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 10:41:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 10:41:42,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 10:41:42,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 10:41:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311965418] [2023-12-26 10:41:42,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311965418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 10:41:42,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 10:41:42,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-26 10:41:42,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910037758] [2023-12-26 10:41:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 10:41:42,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 10:41:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 10:41:42,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 10:41:42,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 10:41:42,236 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:41:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 10:41:42,860 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-26 10:41:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 10:41:42,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-26 10:41:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 10:41:42,867 INFO L225 Difference]: With dead ends: 16 [2023-12-26 10:41:42,867 INFO L226 Difference]: Without dead ends: 9 [2023-12-26 10:41:42,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-26 10:41:42,872 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-26 10:41:42,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-26 10:41:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-26 10:41:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-26 10:41:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:41:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-26 10:41:42,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-26 10:41:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 10:41:42,896 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-26 10:41:42,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:41:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-26 10:41:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-26 10:41:42,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 10:41:42,897 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-26 10:41:42,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-26 10:41:43,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 10:41:43,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 10:41:43,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 10:41:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-26 10:41:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 10:41:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079203636] [2023-12-26 10:41:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 10:41:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 10:41:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 10:41:43,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 10:41:43,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-26 10:41:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 10:41:46,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-26 10:41:46,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 10:41:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 10:41:48,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 10:42:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 10:42:01,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 10:42:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079203636] [2023-12-26 10:42:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079203636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 10:42:01,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 10:42:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 10:42:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703156128] [2023-12-26 10:42:01,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 10:42:01,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 10:42:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 10:42:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 10:42:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2023-12-26 10:42:01,492 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:42:08,820 WARN L854 $PredicateComparison]: unable to prove that (and (or (let ((.cse4 (bvnot |c_ULTIMATE.start_main_~mask_SORT_6~0#1|)) (.cse3 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_6~0#1| |c_ULTIMATE.start_main_~var_129~0#1|))) (.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_241~0#1|))) (let ((.cse6 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_242~0#1|)) (.cse1 (not .cse12)) (.cse0 (or (and (forall ((|v_ULTIMATE.start_main_~var_309_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse10 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_309_arg_1~0#1_13|))) (_ bv16 32))))) (or (= (bvand .cse10 |c_ULTIMATE.start_main_~msb_SORT_6~0#1|) (_ bv0 32)) (not (= (bvand (bvor (bvashr (bvor .cse10 .cse4) |c_ULTIMATE.start_main_~var_129~0#1|) .cse3) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|) |c_ULTIMATE.start_main_~var_126~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_309_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse11 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_309_arg_1~0#1_13|))) (_ bv16 32))))) (or (not (= (bvand .cse11 |c_ULTIMATE.start_main_~msb_SORT_6~0#1|) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_6~0#1| (bvashr (bvand .cse11 |c_ULTIMATE.start_main_~mask_SORT_6~0#1|) |c_ULTIMATE.start_main_~var_129~0#1|)))))))) .cse12))) (and (or (and .cse0 (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~var_308_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse2 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_308_arg_1~0#1_13|))))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|)))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse2) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvor .cse3 (bvashr (bvor .cse4 .cse2) |c_ULTIMATE.start_main_~var_129~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|)))))) (forall ((|v_ULTIMATE.start_main_~var_308_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse5 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_308_arg_1~0#1_13|))))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|)))) (or (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_6~0#1| .cse5) |c_ULTIMATE.start_main_~var_129~0#1|) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse5) (_ bv0 32))))))))) .cse6) (or (not .cse6) (and (or .cse1 (let ((.cse8 (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_19~0#1|))))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse7 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) .cse8))) (or (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvor (bvashr (bvor .cse4 .cse7) |c_ULTIMATE.start_main_~var_129~0#1|) .cse3) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse7) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse9 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) .cse8))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse9) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvashr (bvand .cse9 |c_ULTIMATE.start_main_~mask_SORT_6~0#1|) |c_ULTIMATE.start_main_~var_129~0#1|) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))))))))) .cse0))))) (forall ((|v_ULTIMATE.start_main_~var_718_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_719_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_1145_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_1007_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_771_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_869_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_716_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_1146_arg_1~0#1_14| (_ BitVec 8))) (= ((_ extract 7 0) (let ((.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_1007_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_869_arg_1~0#1_14|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_771_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_716_arg_1~0#1_13|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_242~0#1|)))) .cse13)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_718_arg_0~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_114~0#1|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_719_arg_0~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_241~0#1|)))))))))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_1145_arg_1~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_1146_arg_1~0#1_14|))))))))))))) .cse13))) (_ bv1 32))))))) (_ bv0 8)))) (= |c_ULTIMATE.start_main_~msb_SORT_6~0#1| (_ bv2147483648 32)) (= |c_ULTIMATE.start_main_~var_126~0#1| (_ bv5 32)) (let ((.cse15 (exists ((|ULTIMATE.start_main_~var_309_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_19~0#1| ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_309_arg_1~0#1|)))))) (or (and (exists ((|ULTIMATE.start_main_~var_771_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1007_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_718_arg_0~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet94#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1145_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_869_arg_1~0#1| (_ BitVec 8))) (let ((.cse14 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet94#1_15|) (_ bv1 32))))) (and (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1007_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_771_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_718_arg_0~0#1|) (_ bv1 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse14)))) (_ bv1 32)))) (_ bv0 32)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_869_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1145_arg_1~0#1|)))))))))) (_ bv1 32)))) (not (= .cse14 (_ bv0 8)))))) .cse15) (and (exists ((|ULTIMATE.start_main_~var_771_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1007_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_718_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1145_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_869_arg_1~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_869_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_771_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_718_arg_0~0#1|) (_ bv1 32)))) (_ bv1 32)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1007_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1145_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|))))))) (_ bv1 32))))) (= (_ bv0 16) |c_ULTIMATE.start_main_~state_19~0#1|)) (and (exists ((|v_ULTIMATE.start_main_#t~nondet95#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_771_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1007_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_718_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1145_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_869_arg_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet95#1_15|) (_ bv1 32))))) (and (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1007_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_771_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse16)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_718_arg_0~0#1|)))) (_ bv1 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_869_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1145_arg_1~0#1|)))))))))) (_ bv1 32)))) (not (= .cse16 (_ bv0 8)))))) (exists ((|ULTIMATE.start_main_~var_308_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_19~0#1| ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_308_arg_1~0#1|))))))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet95#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_771_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1007_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_718_arg_0~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet94#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1145_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_869_arg_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet95#1_15|) (_ bv1 32)))) (.cse18 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet94#1_15|) (_ bv1 32))))) (and (not (= .cse17 (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1145_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_869_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_771_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse17)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_718_arg_0~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse18)))) (_ bv1 32)))) (_ bv0 32))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1007_arg_1~0#1|))))))))))))) (_ bv1 32)))) (not (= .cse18 (_ bv0 8)))))) .cse15))) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) (= (_ bv16 32) |c_ULTIMATE.start_main_~var_129~0#1|) (= (_ bv0 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) is different from false [2023-12-26 10:42:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 10:42:10,185 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-26 10:42:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 10:42:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-26 10:42:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 10:42:10,186 INFO L225 Difference]: With dead ends: 14 [2023-12-26 10:42:10,186 INFO L226 Difference]: Without dead ends: 12 [2023-12-26 10:42:10,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=45, Invalid=88, Unknown=3, NotChecked=20, Total=156 [2023-12-26 10:42:10,188 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-26 10:42:10,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 7 Unchecked, 1.9s Time] [2023-12-26 10:42:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-26 10:42:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-26 10:42:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:42:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-26 10:42:10,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-26 10:42:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 10:42:10,195 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-26 10:42:10,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 10:42:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-26 10:42:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-26 10:42:10,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 10:42:10,196 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-26 10:42:10,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-26 10:42:10,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 10:42:10,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 10:42:10,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 10:42:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-26 10:42:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 10:42:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115099921] [2023-12-26 10:42:10,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 10:42:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 10:42:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 10:42:10,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 10:42:10,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-26 10:42:18,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 10:42:18,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 10:42:18,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 6017 conjuncts, 245 conjunts are in the unsatisfiable core [2023-12-26 10:42:18,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 10:42:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 10:42:38,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 10:42:53,913 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") [2023-12-26 10:42:53,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 10:42:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115099921] [2023-12-26 10:42:53,915 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-26 10:42:53,920 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 [2023-12-26 10:42:53,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-26 10:42:54,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 10:42:54,116 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:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) ... 46 more [2023-12-26 10:42:54,120 INFO L158 Benchmark]: Toolchain (without parser) took 79577.31ms. Allocated memory was 295.7MB in the beginning and 1.0GB in the end (delta: 749.7MB). Free memory was 241.6MB in the beginning and 919.9MB in the end (delta: -678.3MB). Peak memory consumption was 672.6MB. Max. memory is 8.0GB. [2023-12-26 10:42:54,120 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 10:42:54,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.14ms. Allocated memory is still 295.7MB. Free memory was 241.6MB in the beginning and 195.9MB in the end (delta: 45.7MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2023-12-26 10:42:54,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.32ms. Allocated memory is still 295.7MB. Free memory was 195.9MB in the beginning and 169.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-26 10:42:54,122 INFO L158 Benchmark]: Boogie Preprocessor took 300.85ms. Allocated memory is still 295.7MB. Free memory was 169.7MB in the beginning and 222.4MB in the end (delta: -52.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-12-26 10:42:54,122 INFO L158 Benchmark]: RCFGBuilder took 5292.33ms. Allocated memory was 295.7MB in the beginning and 550.5MB in the end (delta: 254.8MB). Free memory was 221.8MB in the beginning and 205.5MB in the end (delta: 16.4MB). Peak memory consumption was 305.5MB. Max. memory is 8.0GB. [2023-12-26 10:42:54,123 INFO L158 Benchmark]: TraceAbstraction took 72985.57ms. Allocated memory was 550.5MB in the beginning and 1.0GB in the end (delta: 494.9MB). Free memory was 204.4MB in the beginning and 919.9MB in the end (delta: -715.5MB). Peak memory consumption was 382.1MB. Max. memory is 8.0GB. [2023-12-26 10:42:54,125 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.16ms. Allocated memory is still 178.3MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 816.14ms. Allocated memory is still 295.7MB. Free memory was 241.6MB in the beginning and 195.9MB in the end (delta: 45.7MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 176.32ms. Allocated memory is still 295.7MB. Free memory was 195.9MB in the beginning and 169.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 300.85ms. Allocated memory is still 295.7MB. Free memory was 169.7MB in the beginning and 222.4MB in the end (delta: -52.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * RCFGBuilder took 5292.33ms. Allocated memory was 295.7MB in the beginning and 550.5MB in the end (delta: 254.8MB). Free memory was 221.8MB in the beginning and 205.5MB in the end (delta: 16.4MB). Peak memory consumption was 305.5MB. Max. memory is 8.0GB. * TraceAbstraction took 72985.57ms. Allocated memory was 550.5MB in the beginning and 1.0GB in the end (delta: 494.9MB). Free memory was 204.4MB in the beginning and 919.9MB in the end (delta: -715.5MB). Peak memory consumption was 382.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...