/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 06:59:12,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 06:59:12,087 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-06 06:59:12,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 06:59:12,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 06:59:12,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 06:59:12,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 06:59:12,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 06:59:12,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 06:59:12,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 06:59:12,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 06:59:12,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 06:59:12,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 06:59:12,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 06:59:12,133 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 06:59:12,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 06:59:12,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 06:59:12,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 06:59:12,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 06:59:12,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 06:59:12,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 06:59:12,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 06:59:12,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 06:59:12,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 06:59:12,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 06:59:12,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 06:59:12,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 06:59:12,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 06:59:12,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 06:59:12,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 06:59:12,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 06:59:12,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:59:12,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 06:59:12,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 06:59:12,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 06:59:12,138 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 06:59:12,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 06:59:12,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 06:59:12,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 06:59:12,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 06:59:12,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 06:59:12,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 06:59:12,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 06:59:12,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 06:59:12,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 06:59:12,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 06:59:12,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 06:59:12,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-06 06:59:13,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 06:59:14,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 06:59:14,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-06 06:59:14,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c16363e/9e1e33a1999f4e35ba3148a55dd997da/FLAGba69ecbad [2024-11-06 06:59:14,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c16363e/9e1e33a1999f4e35ba3148a55dd997da [2024-11-06 06:59:14,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 06:59:14,043 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 06:59:14,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 06:59:14,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 06:59:14,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 06:59:14,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189fb7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14, skipping insertion in model container [2024-11-06 06:59:14,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 06:59:14,278 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.mul4.c[1244,1257] [2024-11-06 06:59:14,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:59:14,372 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 06:59:14,390 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.mul4.c[1244,1257] [2024-11-06 06:59:14,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:59:14,477 INFO L204 MainTranslator]: Completed translation [2024-11-06 06:59:14,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14 WrapperNode [2024-11-06 06:59:14,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 06:59:14,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 06:59:14,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 06:59:14,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 06:59:14,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,544 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 299 [2024-11-06 06:59:14,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 06:59:14,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 06:59:14,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 06:59:14,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 06:59:14,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,581 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-06 06:59:14,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 06:59:14,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 06:59:14,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 06:59:14,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 06:59:14,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:59:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 06:59:14,658 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-06 06:59:14,663 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-06 06:59:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 06:59:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 06:59:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 06:59:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 06:59:14,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 06:59:14,826 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 06:59:14,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 06:59:15,145 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-06 06:59:15,145 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 06:59:15,156 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 06:59:15,157 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 06:59:15,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:59:15 BoogieIcfgContainer [2024-11-06 06:59:15,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 06:59:15,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 06:59:15,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 06:59:15,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 06:59:15,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:59:14" (1/3) ... [2024-11-06 06:59:15,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1331bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:59:15, skipping insertion in model container [2024-11-06 06:59:15,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14" (2/3) ... [2024-11-06 06:59:15,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1331bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:59:15, skipping insertion in model container [2024-11-06 06:59:15,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:59:15" (3/3) ... [2024-11-06 06:59:15,166 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-11-06 06:59:15,180 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 06:59:15,181 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 06:59:15,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 06:59:15,246 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;@46e3e4fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 06:59:15,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 06:59:15,250 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-06 06:59:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-06 06:59:15,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:59:15,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-06 06:59:15,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:59:15,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:59:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-06 06:59:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:59:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686563025] [2024-11-06 06:59:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:59:15,278 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-06 06:59:15,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:59:15,284 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-06 06:59:15,287 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-06 06:59:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:59:15,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-06 06:59:15,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:59:16,071 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-06 06:59:16,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:59:16,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:59:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686563025] [2024-11-06 06:59:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686563025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:59:16,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:59:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 06:59:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11290133] [2024-11-06 06:59:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:59:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 06:59:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:59:16,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 06:59:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:59:16,104 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-06 06:59:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:59:16,245 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-06 06:59:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 06:59:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-06 06:59:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:59:16,253 INFO L225 Difference]: With dead ends: 17 [2024-11-06 06:59:16,253 INFO L226 Difference]: Without dead ends: 9 [2024-11-06 06:59:16,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:59:16,259 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 06:59:16,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 06:59:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-06 06:59:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-06 06:59:16,278 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-06 06:59:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-06 06:59:16,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-06 06:59:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:59:16,280 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-06 06:59:16,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-06 06:59:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-06 06:59:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 06:59:16,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:59:16,280 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-06 06:59:16,286 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-06 06:59:16,484 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-06 06:59:16,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:59:16,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:59:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-06 06:59:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:59:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704686755] [2024-11-06 06:59:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:59:16,487 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-06 06:59:16,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:59:16,489 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-06 06:59:16,490 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-06 06:59:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:59:16,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-06 06:59:16,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:59:18,194 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-06 06:59:18,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:59:38,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse35 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_74~0#1|))) (let ((.cse30 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (not .cse35))) (.cse31 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse36 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse33 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse35))) (let ((.cse32 (or .cse36 .cse33)) (.cse34 (or (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse35) .cse31)) (.cse25 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse28 (or .cse36 .cse30)) (.cse29 (or .cse31 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse35))) (let ((.cse27 (and .cse28 .cse29)) (.cse17 (not .cse25)) (.cse26 (and .cse32 .cse34)) (.cse22 (and .cse32 (or .cse31 .cse33) .cse34)) (.cse18 (and .cse28 .cse29 (or .cse30 .cse31)))) (let ((.cse10 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse19 (or .cse25 .cse18)) (.cse21 (or .cse25 .cse22)) (.cse24 (or .cse17 .cse26)) (.cse23 (or .cse17 .cse27))) (let ((.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_92~0#1|)) (.cse11 (and .cse23 (or .cse25 .cse27))) (.cse16 (and .cse24 (or .cse25 .cse26))) (.cse14 (and .cse21 .cse24)) (.cse13 (and .cse23 .cse19)) (.cse20 (not .cse10))) (let ((.cse3 (or .cse13 .cse20)) (.cse2 (or .cse14 .cse20)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse1 (or .cse10 (and .cse21 (or .cse17 .cse22)))) (.cse15 (or .cse16 .cse20)) (.cse12 (or .cse11 .cse20)) (.cse4 (or .cse10 (and (or .cse17 .cse18) .cse19))) (.cse5 (not .cse0))) (and (or (and (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse4) .cse5)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 .cse7))) .cse8)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse9))))))))))) (or (and (or .cse10 .cse11) .cse12) .cse5) (or (and (or (and (or .cse10 .cse13) .cse3) .cse5) (or (and .cse2 (or .cse10 .cse14)) .cse0)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse8)))))) (or .cse0 (and .cse15 (or .cse10 .cse16))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))) .cse9)))))))) (and (or (and .cse1 .cse15) .cse0) (or (and .cse12 .cse4) .cse5))))))))))) is different from false [2024-11-06 06:59:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-06 06:59:47,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:59:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704686755] [2024-11-06 06:59:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704686755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 06:59:47,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:59:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-06 06:59:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863221572] [2024-11-06 06:59:47,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:59:47,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 06:59:47,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:59:47,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 06:59:47,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2024-11-06 06:59:47,474 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-06 06:59:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:59:49,038 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-06 06:59:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 06:59:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-06 06:59:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:59:49,039 INFO L225 Difference]: With dead ends: 14 [2024-11-06 06:59:49,039 INFO L226 Difference]: Without dead ends: 12 [2024-11-06 06:59:49,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=35, Invalid=78, Unknown=1, NotChecked=18, Total=132 [2024-11-06 06:59:49,041 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 06:59:49,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.9s Time] [2024-11-06 06:59:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-06 06:59:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-06 06:59:49,048 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-06 06:59:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-06 06:59:49,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-06 06:59:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:59:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-06 06:59:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-06 06:59:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-06 06:59:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-06 06:59:49,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:59:49,050 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-06 06:59:49,059 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-06 06:59:49,250 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-06 06:59:49,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:59:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:59:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-06 06:59:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:59:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418790570] [2024-11-06 06:59:49,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:59:49,253 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-06 06:59:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:59:49,255 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-06 06:59:49,256 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-06 06:59:49,612 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:59:49,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:59:49,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-06 06:59:49,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:00:16,565 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= (_ bv0 64) |c_ULTIMATE.start_main_~var_11~0#1|) (= |c_ULTIMATE.start_main_~state_27~0#1| |c_ULTIMATE.start_main_~state_32~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet25#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet25#1_17|))) |c_ULTIMATE.start_main_~state_32~0#1|)) (exists ((|v_ULTIMATE.start_main_#t~nondet26#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet26#1_17|) (_ bv1 32))) |c_ULTIMATE.start_main_~state_39~0#1|)) (= (_ bv0 32) |c_ULTIMATE.start_main_~var_24~0#1|) (= |c_ULTIMATE.start_main_~state_39~0#1| |c_ULTIMATE.start_main_~state_44~0#1|) (let ((.cse1 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse21 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_30~0#1| (_ bv4294967295 32)))) (.cse2 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_42~0#1| (_ bv4294967295 32))))) (let ((.cse16 (= |c_ULTIMATE.start_main_~state_37~0#1| |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_39~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_32~0#1|)) (.cse7 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse40 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse39 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse40) ((_ zero_extend 24) .cse39)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse39) (not (= (_ bv0 8) .cse40)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8)) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse39) (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))))))))) (.cse8 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse22 (exists ((|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) (.cse6 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse38 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse36 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse38) ((_ zero_extend 24) .cse36)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse36) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))) (not (= (_ bv0 8) .cse38)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse36)))))) (.cse0 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse34 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse33 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse34) ((_ zero_extend 24) .cse33)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse33) (not (= (_ bv0 8) .cse34)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse33) (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))))))))) (.cse10 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse32 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse30 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse32) ((_ zero_extend 24) .cse30)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse30) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))) (not (= (_ bv0 8) .cse32)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8)) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse30)))))) (.cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse11 (and (exists ((|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse29 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse29) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse29)))) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_12~0#1|) (or .cse1 (= (_ bv0 64) |c_ULTIMATE.start_main_~state_18~0#1|))))) (or (and (let ((.cse5 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) (or (and (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse3 (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| .cse3) (= |c_ULTIMATE.start_main_~state_12~0#1| .cse3)))))) (and (or (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse4 ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul .cse4 .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse4) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse5) .cse6) (and .cse7 (or (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) .cse8)) (and (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse10) .cse11) (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse13))))))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse14))))) (_ bv0 8)))))) (and (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse13))))))) (not (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse14))))) (_ bv0 8)))))) .cse16 (or (and .cse7 (or .cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse18 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32))))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse18) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse18) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|)))))) (and .cse6 (or .cse5 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse19 ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul .cse19 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse19) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))))) (and (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|)))) .cse10) .cse11 (and (or (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse20 (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))))) (and (= .cse20 |c_ULTIMATE.start_main_~state_12~0#1|) (= .cse20 |c_ULTIMATE.start_main_~state_18~0#1|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse0))))) (= |c_ULTIMATE.start_main_~state_30~0#1| |c_ULTIMATE.start_main_~state_25~0#1|)) (and .cse16 (or (and (or (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) .cse22) .cse6) (and .cse10 (or (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) .cse9)) (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse23 (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| .cse23) (= |c_ULTIMATE.start_main_~state_12~0#1| .cse23)))))) (and .cse7 (or .cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse24 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32))))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse24) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|) (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 .cse24) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64)))))))) .cse11) (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse14))))) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse13)))))))))) (and (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse14))))) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse13))))))))) (let ((.cse27 (bvlshr (bvmul .cse21 .cse2) (_ bv2 64)))) (or (and .cse7 (or .cse8 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))))) (and (or (exists ((|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))) .cse22) .cse6) (and .cse0 (or (exists ((|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse28 (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)))) (and (= .cse28 |c_ULTIMATE.start_main_~state_12~0#1|) (= .cse28 |c_ULTIMATE.start_main_~state_18~0#1|)))) (and .cse1 (exists ((|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))))) (and .cse10 (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))))) .cse11)))))) (= (_ bv0 32) (bvadd |c_ULTIMATE.start_main_~mask_SORT_3~0#1| (_ bv1 32)))) is different from false