/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.sw_sym_ex.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 10:16:24,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 10:16:24,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 10:16:25,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 10:16:25,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 10:16:25,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 10:16:25,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 10:16:25,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 10:16:25,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 10:16:25,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 10:16:25,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 10:16:25,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 10:16:25,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 10:16:25,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 10:16:25,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 10:16:25,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 10:16:25,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 10:16:25,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 10:16:25,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 10:16:25,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 10:16:25,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 10:16:25,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 10:16:25,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 10:16:25,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 10:16:25,037 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 10:16:25,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 10:16:25,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 10:16:25,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 10:16:25,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 10:16:25,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 10:16:25,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 10:16:25,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 10:16:25,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 10:16:25,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 10:16:25,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 10:16:25,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 10:16:25,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 10:16:25,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 10:16:25,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 10:16:25,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 10:16:25,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 10:16:25,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:25,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 10:16:25,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 10:16:25,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 10:16:25,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 10:16:25,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 10:16:25,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex.c [2024-11-05 10:16:26,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 10:16:26,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 10:16:26,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex.c [2024-11-05 10:16:26,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74312a2d/efa6ab9633fa49a3811e633e4552d5e3/FLAGad8bae727 [2024-11-05 10:16:27,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74312a2d/efa6ab9633fa49a3811e633e4552d5e3 [2024-11-05 10:16:27,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 10:16:27,313 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 10:16:27,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 10:16:27,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 10:16:27,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 10:16:27,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9037b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27, skipping insertion in model container [2024-11-05 10:16:27,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 10:16:27,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex.c[1249,1262] [2024-11-05 10:16:27,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 10:16:27,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 10:16:27,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex.c[1249,1262] [2024-11-05 10:16:27,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 10:16:27,809 INFO L204 MainTranslator]: Completed translation [2024-11-05 10:16:27,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27 WrapperNode [2024-11-05 10:16:27,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 10:16:27,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 10:16:27,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 10:16:27,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 10:16:27,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,876 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 556 [2024-11-05 10:16:27,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 10:16:27,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 10:16:27,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 10:16:27,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 10:16:27,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,918 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 10:16:27,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 10:16:27,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 10:16:27,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 10:16:27,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 10:16:27,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (1/1) ... [2024-11-05 10:16:27,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 10:16:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 10:16:27,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 10:16:27,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 10:16:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 10:16:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 10:16:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 10:16:28,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 10:16:28,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 10:16:28,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 10:16:28,644 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-05 10:16:28,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 10:16:28,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 10:16:28,655 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 10:16:28,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:16:28 BoogieIcfgContainer [2024-11-05 10:16:28,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 10:16:28,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 10:16:28,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 10:16:28,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 10:16:28,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 10:16:27" (1/3) ... [2024-11-05 10:16:28,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2415e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:16:28, skipping insertion in model container [2024-11-05 10:16:28,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:16:27" (2/3) ... [2024-11-05 10:16:28,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2415e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:16:28, skipping insertion in model container [2024-11-05 10:16:28,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:16:28" (3/3) ... [2024-11-05 10:16:28,663 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_sym_ex.c [2024-11-05 10:16:28,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 10:16:28,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 10:16:28,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 10:16:28,741 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;@16bb0dfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 10:16:28,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 10:16:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2024-11-05 10:16:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 10:16:28,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:16:28,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 10:16:28,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:16:28,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:16:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 10:16:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:16:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531151885] [2024-11-05 10:16:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:16:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:16:28,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 10:16:28,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 10:16:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:16:28,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 10:16:28,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:16:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:16:29,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:16:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:16:29,114 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:16:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531151885] [2024-11-05 10:16:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1531151885] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 10:16:29,115 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 10:16:29,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 10:16:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029655149] [2024-11-05 10:16:29,118 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 10:16:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 10:16:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:16:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 10:16:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 10:16:29,149 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2024-11-05 10:16:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:16:29,220 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-05 10:16:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 10:16:29,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) Word has length 5 [2024-11-05 10:16:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:16:29,230 INFO L225 Difference]: With dead ends: 18 [2024-11-05 10:16:29,230 INFO L226 Difference]: Without dead ends: 10 [2024-11-05 10:16:29,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 10:16:29,238 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 10:16:29,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 10:16:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-05 10:16:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-05 10:16:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 10:16:29,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 10:16:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:16:29,269 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 10:16:29,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2024-11-05 10:16:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 10:16:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 10:16:29,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:16:29,271 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 10:16:29,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 10:16:29,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:29,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:16:29,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:16:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 10:16:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:16:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694063738] [2024-11-05 10:16:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:16:29,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:16:29,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 10:16:29,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 10:16:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:16:29,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-05 10:16:29,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:16:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:16:29,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:16:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:16:30,110 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:16:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694063738] [2024-11-05 10:16:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1694063738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 10:16:30,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 10:16:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 10:16:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007612219] [2024-11-05 10:16:30,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 10:16:30,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 10:16:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:16:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 10:16:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 10:16:30,114 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:16:30,182 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-05 10:16:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 10:16:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-05 10:16:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:16:30,184 INFO L225 Difference]: With dead ends: 15 [2024-11-05 10:16:30,184 INFO L226 Difference]: Without dead ends: 13 [2024-11-05 10:16:30,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-05 10:16:30,185 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 10:16:30,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 10:16:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-05 10:16:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-05 10:16:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-05 10:16:30,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-05 10:16:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:16:30,191 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-05 10:16:30,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-05 10:16:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 10:16:30,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:16:30,192 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-05 10:16:30,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 10:16:30,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:30,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:16:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:16:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-05 10:16:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:16:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650812551] [2024-11-05 10:16:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:16:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:30,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:16:30,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 10:16:30,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 10:16:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:16:30,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-05 10:16:30,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:16:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:16:31,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:16:40,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse92 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|)) (.cse90 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_19~0#1|)) (.cse105 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_34~0#1|)) (.cse104 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_36~0#1|)) (.cse37 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse38 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_27~0#1|))) (let ((.cse97 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 (_ bv1 32)))))))))) (.cse94 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse37)))))) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_42~0#1|)) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse105 .cse104)))) (.cse8 (= |c_ULTIMATE.start_main_~state_31~0#1| (_ bv0 8))) (.cse25 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse93 ((_ zero_extend 24) ((_ extract 7 0) .cse37))) (.cse88 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_21~0#1|)) (.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse90)))) (.cse89 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse92))))) (let ((.cse49 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_25~0#1|)) (.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse91 .cse89)))) (.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|)) (.cse28 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_19~0#1|)) (.cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse89)))) (.cse86 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse88)))) (.cse57 (forall ((|v_ULTIMATE.start_main_~var_15_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse93)))))))))))))))) (.cse5 (not .cse8)) (.cse95 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))))))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse105))) (.cse15 (forall ((|v_ULTIMATE.start_main_~var_15_arg_0~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse94))))))))))) .cse25)) (_ bv0 8)))) (.cse21 (forall ((|v_ULTIMATE.start_main_~var_15_arg_0~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) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse97)))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_17|)))) .cse25)) (_ bv0 8)))) (.cse99 ((_ zero_extend 24) ((_ extract 7 0) .cse104))) (.cse98 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_33~0#1|))) (let ((.cse10 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8))) (not (= .cse98 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))))) (.cse30 (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse103 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|))))))) .cse99))) .cse103))))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse103)))))))) (.cse29 (or (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse102))))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|))))))) .cse99))) .cse102))))))) .cse21)) (.cse31 (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse101 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse101))))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|))))))) .cse99))) .cse101))))))))) (.cse32 (or .cse15 (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|))))))) .cse99))) .cse100)))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse100))))))))) (.cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 .cse99))) ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))))))) (.cse11 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8))) (= .cse98 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))) (.cse27 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|) .cse98))) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) .cse99))) (.cse1 (or .cse95 .cse15 .cse8)) (.cse2 (or .cse57 .cse5 .cse95)) (.cse9 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|) .cse98)))) (.cse53 (or .cse57 .cse95)) (.cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))))))) (.cse34 (forall ((v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 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) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) v_subst_1))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_17|)))) .cse25))))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse86 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse92))))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse88 .cse96)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse96 .cse86)))) (.cse51 (or .cse95 .cse15)) (.cse52 (not .cse28)) (.cse56 (forall ((v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse94 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) v_subst_1)))))))))))))))))) .cse25)) (_ bv0 8)))) (.cse58 (forall ((v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse93 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) v_subst_1)))))))))))))))))) .cse25))))) (.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse91 .cse92))) .cse86)))) (.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse86 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse90))))))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse50)))) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse88 .cse87)))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse37)))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse38)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse49)))) (.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse86 .cse87)))) (.cse66 (= |c_ULTIMATE.start_main_~state_23~0#1| (_ bv0 8)))) (and (or (let ((.cse47 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse47))))) (let ((.cse55 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse42))))) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse44))))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse60))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse59))) .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse50))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse60)))))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse49)))))) .cse36))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ 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) ((_ extract 7 0) (bvand .cse42 .cse62))) .cse44))) .cse41))) .cse36))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 .cse42))) .cse44))))))))) .cse40)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse64))) .cse44))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse47)))))) .cse41)))))) .cse40)))))))))))))))))))))))))) (let ((.cse54 (not .cse55))) (let ((.cse4 (and (or .cse57 .cse54) (or .cse55 .cse58)))) (let ((.cse24 (and (or .cse54 .cse15) (or .cse56 .cse55))) (.cse7 (and (or .cse21 .cse54) (or .cse55 .cse34))) (.cse26 (or (and (or .cse3 .cse4) .cse53) .cse5))) (let ((.cse0 (or .cse27 (and (or (and (or .cse28 (and .cse29 (or .cse30 .cse24) (or .cse31 .cse7) .cse32)) (or (and (or .cse3 (let ((.cse33 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse46))))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse44))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse39))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse36))) .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse39)))))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse43))) .cse44)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse45))) .cse44))) .cse41)))))) .cse40))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse47))) .cse44))) .cse41)))))) .cse40)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse49))))))))) .cse40))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse50))) .cse40)))))))))))) .cse25))))) (and (or (not .cse33) .cse21) (or .cse33 .cse34)))) .cse51) .cse52)) .cse8) .cse26)))) (and (or (and .cse0 (or (and .cse1 .cse2 (or .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8)) .cse9)) .cse10) (or .cse11 (and (or .cse9 (and (or (let ((.cse12 (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) .cse25))))) (and (or (not .cse12) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse16)) .cse17))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))))))) .cse7) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))))) .cse15)))) (or (and (or (forall ((|ULTIMATE.start_main_~var_199~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19))))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_199~0#1|))))))) .cse17))) .cse19)))))))) .cse7) (or .cse15 (forall ((|ULTIMATE.start_main_~var_199~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_199~0#1|))))))) .cse17))) .cse20)))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse20)))))))) (or .cse21 (forall ((|ULTIMATE.start_main_~var_199~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse22))))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_199~0#1|))))))) .cse17))) .cse22)))))))) (or (forall ((|ULTIMATE.start_main_~var_199~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_199~0#1|))))))) .cse17))) .cse23))))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse23))))))) .cse24)) .cse12))) .cse8) .cse26)) .cse0)))))))))) .cse66) (or (let ((.cse77 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 (_ bv255 32)))))) (let ((.cse84 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse85 .cse44))))) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse84))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse83)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse84))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse85 .cse49))))))))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse62))) .cse44))))))))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 (_ bv255 32)))) .cse44))))))))) .cse40)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse64))) .cse44))))))))) .cse40)))))) (_ bv0 32)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse83))) .cse40))))))))))))))))) (let ((.cse78 (not .cse77))) (let ((.cse76 (and (or .cse77 .cse58) (or .cse57 .cse78)))) (let ((.cse68 (and (or .cse78 .cse15) (or .cse77 .cse56))) (.cse67 (or (and (or .cse3 (let ((.cse79 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse46))))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse82 .cse44))))) (let ((.cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse81))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse80))) .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse80))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse81))) .cse36))) .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse45))))))))))))))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse43)))))))))))) .cse40))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse82 .cse49))))))))) .cse40)))))))))))))))))) .cse25))))) (and (or .cse21 (not .cse79)) (or .cse79 .cse34)))) .cse51) .cse52)) (.cse70 (or .cse5 (and .cse53 (or .cse3 .cse76)))) (.cse69 (and (or .cse77 .cse34) (or .cse21 .cse78))) (.cse71 (or .cse3 .cse5 .cse76))) (and (or .cse10 (and (or .cse27 (and (or (and .cse67 (or .cse28 (and (or .cse30 .cse68) .cse29 (or .cse31 .cse69) .cse32))) .cse8) .cse70)) (or .cse9 (and .cse1 (or .cse6 .cse69 .cse8) .cse2 .cse71)))) (or .cse11 (and (or (and (or (and (or .cse28 (and (or (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse72 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse72))))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|)))))))))) .cse72)))))))) .cse69) (or .cse68 (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse73 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse73)))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|)))))))))) .cse73))))))))) (or (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse74 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse74)))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|)))))))))) .cse74))))))) .cse15) (or .cse21 (forall ((|ULTIMATE.start_main_~var_193~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse75 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse75))))) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_193~0#1|)))))))))) .cse75)))))))))) .cse67) .cse8) .cse70) .cse27) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse17))) ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))))))) .cse69 .cse8) .cse1 .cse2 .cse71) .cse9)))))))) (not .cse66))))))) is different from false [2024-11-05 10:16:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-05 10:16:53,580 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:16:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650812551] [2024-11-05 10:16:53,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1650812551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 10:16:53,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 10:16:53,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 10:16:53,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052382552] [2024-11-05 10:16:53,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 10:16:53,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 10:16:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 10:16:53,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 10:16:53,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=48, Unknown=1, NotChecked=14, Total=90 [2024-11-05 10:16:53,582 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 10:16:54,612 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-05 10:16:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 10:16:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-05 10:16:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 10:16:54,613 INFO L225 Difference]: With dead ends: 18 [2024-11-05 10:16:54,613 INFO L226 Difference]: Without dead ends: 16 [2024-11-05 10:16:54,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=53, Invalid=82, Unknown=1, NotChecked=20, Total=156 [2024-11-05 10:16:54,615 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 10:16:54,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 9 Unchecked, 0.2s Time] [2024-11-05 10:16:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-05 10:16:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-05 10:16:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-05 10:16:54,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-05 10:16:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 10:16:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-05 10:16:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 10:16:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-05 10:16:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 10:16:54,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 10:16:54,624 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-05 10:16:54,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 10:16:54,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:54,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 10:16:54,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 10:16:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-05 10:16:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 10:16:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12940008] [2024-11-05 10:16:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 10:16:54,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:16:54,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 10:16:54,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 10:16:54,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 10:16:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 10:16:55,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-05 10:16:55,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 10:16:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 10:16:59,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 10:17:05,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-05 10:17:05,724 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-05 10:17:05,725 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 10:17:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12940008] [2024-11-05 10:17:05,725 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-05 10:17:05,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 10:17:05,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 10:17:05,927 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:842) 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-05 10:17:05,931 INFO L158 Benchmark]: Toolchain (without parser) took 38617.47ms. Allocated memory was 293.6MB in the beginning and 695.2MB in the end (delta: 401.6MB). Free memory was 249.7MB in the beginning and 355.2MB in the end (delta: -105.5MB). Peak memory consumption was 297.4MB. Max. memory is 8.0GB. [2024-11-05 10:17:05,931 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 10:17:05,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.88ms. Allocated memory is still 293.6MB. Free memory was 249.7MB in the beginning and 223.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-11-05 10:17:05,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.45ms. Allocated memory is still 293.6MB. Free memory was 223.5MB in the beginning and 218.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-11-05 10:17:05,932 INFO L158 Benchmark]: Boogie Preprocessor took 74.19ms. Allocated memory is still 293.6MB. Free memory was 218.3MB in the beginning and 212.5MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-11-05 10:17:05,932 INFO L158 Benchmark]: RCFGBuilder took 703.56ms. Allocated memory is still 293.6MB. Free memory was 212.5MB in the beginning and 218.9MB in the end (delta: -6.4MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. [2024-11-05 10:17:05,933 INFO L158 Benchmark]: TraceAbstraction took 37273.01ms. Allocated memory was 293.6MB in the beginning and 695.2MB in the end (delta: 401.6MB). Free memory was 217.8MB in the beginning and 355.2MB in the end (delta: -137.4MB). Peak memory consumption was 264.5MB. Max. memory is 8.0GB. [2024-11-05 10:17:05,934 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.13ms. Allocated memory is still 181.4MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.88ms. Allocated memory is still 293.6MB. Free memory was 249.7MB in the beginning and 223.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.45ms. Allocated memory is still 293.6MB. Free memory was 223.5MB in the beginning and 218.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.19ms. Allocated memory is still 293.6MB. Free memory was 218.3MB in the beginning and 212.5MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 703.56ms. Allocated memory is still 293.6MB. Free memory was 212.5MB in the beginning and 218.9MB in the end (delta: -6.4MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. * TraceAbstraction took 37273.01ms. Allocated memory was 293.6MB in the beginning and 695.2MB in the end (delta: 401.6MB). Free memory was 217.8MB in the beginning and 355.2MB in the end (delta: -137.4MB). Peak memory consumption was 264.5MB. 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...