./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 06:04:13,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 06:04:13,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 06:04:13,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 06:04:13,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 06:04:13,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 06:04:13,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 06:04:13,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 06:04:13,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 06:04:13,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 06:04:13,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 06:04:13,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 06:04:13,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 06:04:13,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 06:04:13,682 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 06:04:13,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 06:04:13,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 06:04:13,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 06:04:13,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 06:04:13,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 06:04:13,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 06:04:13,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 06:04:13,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 06:04:13,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 06:04:13,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 06:04:13,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 06:04:13,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 06:04:13,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 06:04:13,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 06:04:13,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:04:13,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 06:04:13,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 06:04:13,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 06:04:13,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 06:04:13,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 06:04:13,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 06:04:13,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 06:04:13,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 06:04:13,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 06:04:13,692 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c [2024-11-22 06:04:13,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 06:04:14,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 06:04:14,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 06:04:14,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 06:04:14,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 06:04:14,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2024-11-22 06:04:15,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 06:04:15,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 06:04:15,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2024-11-22 06:04:15,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29741a0e1/02cbb7fd67464cc2b042fda55af40711/FLAG944984c79 [2024-11-22 06:04:15,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29741a0e1/02cbb7fd67464cc2b042fda55af40711 [2024-11-22 06:04:15,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 06:04:15,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 06:04:15,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 06:04:15,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 06:04:15,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 06:04:15,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:15" (1/1) ... [2024-11-22 06:04:15,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e8dbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:15, skipping insertion in model container [2024-11-22 06:04:15,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:15" (1/1) ... [2024-11-22 06:04:15,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 06:04:15,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2024-11-22 06:04:16,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:04:16,038 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 06:04:16,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2024-11-22 06:04:16,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:04:16,150 INFO L204 MainTranslator]: Completed translation [2024-11-22 06:04:16,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16 WrapperNode [2024-11-22 06:04:16,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 06:04:16,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 06:04:16,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 06:04:16,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 06:04:16,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,268 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 773 [2024-11-22 06:04:16,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 06:04:16,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 06:04:16,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 06:04:16,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 06:04:16,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,355 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-22 06:04:16,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 06:04:16,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 06:04:16,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 06:04:16,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 06:04:16,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (1/1) ... [2024-11-22 06:04:16,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:04:16,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:04:16,490 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-22 06:04:16,494 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-22 06:04:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 06:04:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 06:04:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 06:04:16,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 06:04:16,720 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 06:04:16,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 06:04:17,500 INFO L? ?]: Removed 411 outVars from TransFormulas that were not future-live. [2024-11-22 06:04:17,501 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 06:04:17,516 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 06:04:17,517 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 06:04:17,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:17 BoogieIcfgContainer [2024-11-22 06:04:17,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 06:04:17,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 06:04:17,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 06:04:17,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 06:04:17,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:04:15" (1/3) ... [2024-11-22 06:04:17,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728fe1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:17, skipping insertion in model container [2024-11-22 06:04:17,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:16" (2/3) ... [2024-11-22 06:04:17,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728fe1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:17, skipping insertion in model container [2024-11-22 06:04:17,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:17" (3/3) ... [2024-11-22 06:04:17,529 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2024-11-22 06:04:17,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 06:04:17,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 06:04:17,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 06:04:17,622 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;@5a95ec53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 06:04:17,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 06:04:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 144 states have (on average 1.4930555555555556) internal successors, (215), 145 states have internal predecessors, (215), 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-22 06:04:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 06:04:17,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:04:17,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:04:17,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:04:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:04:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1151399295, now seen corresponding path program 1 times [2024-11-22 06:04:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:04:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398453737] [2024-11-22 06:04:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:04:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:04:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:04:18,329 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-22 06:04:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:04:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398453737] [2024-11-22 06:04:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398453737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:04:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:04:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 06:04:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471553773] [2024-11-22 06:04:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:04:18,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 06:04:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:04:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 06:04:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:04:18,364 INFO L87 Difference]: Start difference. First operand has 146 states, 144 states have (on average 1.4930555555555556) internal successors, (215), 145 states have internal predecessors, (215), 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 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-22 06:04:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:04:18,430 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2024-11-22 06:04:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 06:04:18,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-22 06:04:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:04:18,443 INFO L225 Difference]: With dead ends: 233 [2024-11-22 06:04:18,443 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 06:04:18,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:04:18,451 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:04:18,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 621 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:04:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 06:04:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-22 06:04:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4791666666666667) internal successors, (213), 144 states have internal predecessors, (213), 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-22 06:04:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 213 transitions. [2024-11-22 06:04:18,493 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 213 transitions. Word has length 43 [2024-11-22 06:04:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:04:18,494 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 213 transitions. [2024-11-22 06:04:18,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-22 06:04:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 213 transitions. [2024-11-22 06:04:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 06:04:18,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:04:18,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:04:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 06:04:18,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:04:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:04:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1331944377, now seen corresponding path program 1 times [2024-11-22 06:04:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:04:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427031468] [2024-11-22 06:04:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:04:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:04:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:04:18,708 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-22 06:04:18,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:04:18,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427031468] [2024-11-22 06:04:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427031468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:04:18,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:04:18,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 06:04:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598190378] [2024-11-22 06:04:18,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:04:18,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 06:04:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:04:18,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 06:04:18,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:04:18,717 INFO L87 Difference]: Start difference. First operand 145 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-22 06:04:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:04:18,778 INFO L93 Difference]: Finished difference Result 234 states and 343 transitions. [2024-11-22 06:04:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 06:04:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-11-22 06:04:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:04:18,780 INFO L225 Difference]: With dead ends: 234 [2024-11-22 06:04:18,780 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 06:04:18,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:04:18,784 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 617 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-22 06:04:18,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:04:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 06:04:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-22 06:04:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 146 states have internal predecessors, (215), 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-22 06:04:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2024-11-22 06:04:18,798 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 44 [2024-11-22 06:04:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:04:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2024-11-22 06:04:18,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-22 06:04:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2024-11-22 06:04:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 06:04:18,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:04:18,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:04:18,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 06:04:18,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:04:18,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:04:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 561431578, now seen corresponding path program 1 times [2024-11-22 06:04:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:04:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150706129] [2024-11-22 06:04:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:04:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:04:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:04:19,196 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-22 06:04:19,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:04:19,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150706129] [2024-11-22 06:04:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150706129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:04:19,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:04:19,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 06:04:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052339261] [2024-11-22 06:04:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:04:19,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 06:04:19,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:04:19,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 06:04:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 06:04:19,200 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-22 06:04:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:04:19,322 INFO L93 Difference]: Finished difference Result 240 states and 350 transitions. [2024-11-22 06:04:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 06:04:19,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 45 [2024-11-22 06:04:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:04:19,324 INFO L225 Difference]: With dead ends: 240 [2024-11-22 06:04:19,326 INFO L226 Difference]: Without dead ends: 151 [2024-11-22 06:04:19,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 06:04:19,328 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 182 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 06:04:19,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 756 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 06:04:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-22 06:04:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-22 06:04:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4630872483221478) internal successors, (218), 149 states have internal predecessors, (218), 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-22 06:04:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2024-11-22 06:04:19,336 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 45 [2024-11-22 06:04:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:04:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2024-11-22 06:04:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-22 06:04:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2024-11-22 06:04:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 06:04:19,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:04:19,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:04:19,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 06:04:19,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:04:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:04:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1789055082, now seen corresponding path program 1 times [2024-11-22 06:04:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:04:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180797864] [2024-11-22 06:04:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:04:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:04:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 06:04:19,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 06:04:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 06:04:19,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 06:04:19,479 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 06:04:19,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 06:04:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 06:04:19,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 06:04:19,541 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 06:04:19,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:04:19 BoogieIcfgContainer [2024-11-22 06:04:19,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 06:04:19,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 06:04:19,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 06:04:19,545 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 06:04:19,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:17" (3/4) ... [2024-11-22 06:04:19,549 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 06:04:19,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 06:04:19,551 INFO L158 Benchmark]: Toolchain (without parser) took 3875.74ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 130.0MB in the beginning and 69.5MB in the end (delta: 60.5MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,551 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 06:04:19,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.41ms. Allocated memory is still 159.4MB. Free memory was 130.0MB in the beginning and 106.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.30ms. Allocated memory is still 159.4MB. Free memory was 106.2MB in the beginning and 91.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,552 INFO L158 Benchmark]: Boogie Preprocessor took 183.37ms. Allocated memory is still 159.4MB. Free memory was 91.5MB in the beginning and 81.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,553 INFO L158 Benchmark]: RCFGBuilder took 1065.04ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 109.0MB in the end (delta: -27.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,553 INFO L158 Benchmark]: TraceAbstraction took 2023.64ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 109.0MB in the beginning and 70.6MB in the end (delta: 38.5MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,554 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 220.2MB. Free memory was 70.6MB in the beginning and 69.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 06:04:19,555 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.20ms. Allocated memory is still 109.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.41ms. Allocated memory is still 159.4MB. Free memory was 130.0MB in the beginning and 106.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.30ms. Allocated memory is still 159.4MB. Free memory was 106.2MB in the beginning and 91.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 183.37ms. Allocated memory is still 159.4MB. Free memory was 91.5MB in the beginning and 81.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1065.04ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 109.0MB in the end (delta: -27.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2023.64ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 109.0MB in the beginning and 70.6MB in the end (delta: 38.5MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 220.2MB. Free memory was 70.6MB in the beginning and 69.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 173. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L44] const SORT_67 var_68 = 0; [L45] const SORT_10 var_122 = 104; [L46] const SORT_10 var_145 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_29; [L53] SORT_31 input_32; [L54] SORT_31 input_34; [L55] SORT_1 input_36; [L56] SORT_1 input_42; [L57] SORT_1 input_44; [L58] SORT_1 input_46; [L59] SORT_3 input_50; [L60] SORT_1 input_53; [L61] SORT_1 input_63; [L62] SORT_1 input_73; [L63] SORT_1 input_79; [L64] SORT_1 input_80; [L65] SORT_1 input_91; [L66] SORT_1 input_98; [L67] SORT_1 input_104; [L68] SORT_1 input_110; [L69] SORT_1 input_116; [L70] SORT_1 input_117; [L71] SORT_1 input_118; [L72] SORT_1 input_135; [L73] SORT_67 input_143; [L74] SORT_1 input_152; [L75] SORT_1 input_153; [L76] SORT_1 input_154; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L78] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L79] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L80] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L81] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L82] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L83] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L84] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L85] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L86] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L87] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L88] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L89] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L90] SORT_67 state_69 = __VERIFIER_nondet_ushort() & mask_SORT_67; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L91] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] SORT_1 init_9_arg_1 = var_7; [L94] state_8 = init_9_arg_1 [L95] SORT_1 init_15_arg_1 = var_7; [L96] state_14 = init_15_arg_1 [L97] SORT_1 init_26_arg_1 = var_7; [L98] state_25 = init_26_arg_1 [L99] SORT_1 init_28_arg_1 = var_7; [L100] state_27 = init_28_arg_1 [L101] SORT_1 init_39_arg_1 = var_7; [L102] state_38 = init_39_arg_1 [L103] SORT_1 init_41_arg_1 = var_7; [L104] state_40 = init_41_arg_1 [L105] SORT_1 init_49_arg_1 = var_21; [L106] state_48 = init_49_arg_1 [L107] SORT_1 init_56_arg_1 = var_7; [L108] state_55 = init_56_arg_1 [L109] SORT_1 init_58_arg_1 = var_7; [L110] state_57 = init_58_arg_1 [L111] SORT_1 init_60_arg_1 = var_7; [L112] state_59 = init_60_arg_1 [L113] SORT_1 init_62_arg_1 = var_7; [L114] state_61 = init_62_arg_1 [L115] SORT_1 init_66_arg_1 = var_7; [L116] state_65 = init_66_arg_1 [L117] SORT_67 init_70_arg_1 = var_68; [L118] state_69 = init_70_arg_1 [L119] SORT_1 init_72_arg_1 = var_7; [L120] state_71 = init_72_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L123] input_2 = __VERIFIER_nondet_uchar() [L124] input_4 = __VERIFIER_nondet_uchar() [L125] input_5 = __VERIFIER_nondet_uchar() [L126] input_6 = __VERIFIER_nondet_uchar() [L127] input_29 = __VERIFIER_nondet_uchar() [L128] input_32 = __VERIFIER_nondet_uchar() [L129] input_34 = __VERIFIER_nondet_uchar() [L130] input_36 = __VERIFIER_nondet_uchar() [L131] input_42 = __VERIFIER_nondet_uchar() [L132] input_44 = __VERIFIER_nondet_uchar() [L133] input_46 = __VERIFIER_nondet_uchar() [L134] input_50 = __VERIFIER_nondet_uchar() [L135] input_53 = __VERIFIER_nondet_uchar() [L136] input_63 = __VERIFIER_nondet_uchar() [L137] input_73 = __VERIFIER_nondet_uchar() [L138] input_79 = __VERIFIER_nondet_uchar() [L139] input_80 = __VERIFIER_nondet_uchar() [L140] input_91 = __VERIFIER_nondet_uchar() [L141] input_98 = __VERIFIER_nondet_uchar() [L142] input_104 = __VERIFIER_nondet_uchar() [L143] input_110 = __VERIFIER_nondet_uchar() [L144] input_116 = __VERIFIER_nondet_uchar() [L145] input_117 = __VERIFIER_nondet_uchar() [L146] input_118 = __VERIFIER_nondet_uchar() [L147] input_135 = __VERIFIER_nondet_uchar() [L148] input_143 = __VERIFIER_nondet_ushort() [L149] input_152 = __VERIFIER_nondet_uchar() [L150] input_153 = __VERIFIER_nondet_uchar() [L151] input_154 = __VERIFIER_nondet_uchar() [L154] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_11_arg_0=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L155] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L155] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L156] SORT_10 var_11 = var_11_arg_0; [L157] SORT_10 var_13_arg_0 = var_11; [L158] SORT_10 var_13_arg_1 = var_12; [L159] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L160] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_13=1, var_145=1, var_16_arg_0=0, var_21=1, var_68=0, var_7=0] [L161] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_13=1, var_145=1, var_21=1, var_68=0, var_7=0] [L161] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L162] SORT_10 var_16 = var_16_arg_0; [L163] SORT_10 var_17_arg_0 = var_16; [L164] SORT_10 var_17_arg_1 = var_12; [L165] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L166] SORT_1 var_18_arg_0 = var_13; [L167] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_68=0, var_7=0] [L168] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L168] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L169] SORT_1 var_22_arg_0 = var_18; [L170] SORT_1 var_22 = ~var_22_arg_0; [L171] SORT_1 var_23_arg_0 = var_21; [L172] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_68=0, var_7=0] [L173] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L173] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L174] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L174] var_23 = var_23 & mask_SORT_1 [L175] SORT_1 bad_24_arg_0 = var_23; [L176] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 1994 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1385 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 609 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 06:04:19,582 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 06:04:21,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 06:04:21,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 06:04:21,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 06:04:21,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 06:04:21,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 06:04:21,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 06:04:21,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 06:04:21,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 06:04:21,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 06:04:21,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 06:04:21,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 06:04:21,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 06:04:21,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 06:04:21,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 06:04:21,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 06:04:21,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 06:04:21,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 06:04:21,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 06:04:21,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 06:04:21,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 06:04:21,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 06:04:21,931 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 06:04:21,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 06:04:21,932 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 06:04:21,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 06:04:21,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 06:04:21,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 06:04:21,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 06:04:21,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 06:04:21,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 06:04:21,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:04:21,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 06:04:21,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 06:04:21,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 06:04:21,934 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 06:04:21,935 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 06:04:21,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 06:04:21,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 06:04:21,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 06:04:21,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 06:04:21,937 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c [2024-11-22 06:04:22,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 06:04:22,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 06:04:22,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 06:04:22,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 06:04:22,306 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 06:04:22,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2024-11-22 06:04:23,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 06:04:24,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 06:04:24,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2024-11-22 06:04:24,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabab935c/2f881995d10e4213a7c35fdaeae7e240/FLAG5db213732 [2024-11-22 06:04:24,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabab935c/2f881995d10e4213a7c35fdaeae7e240 [2024-11-22 06:04:24,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 06:04:24,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 06:04:24,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 06:04:24,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 06:04:24,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 06:04:24,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f5652c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24, skipping insertion in model container [2024-11-22 06:04:24,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 06:04:24,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2024-11-22 06:04:24,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:04:24,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 06:04:24,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2024-11-22 06:04:24,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:04:24,626 INFO L204 MainTranslator]: Completed translation [2024-11-22 06:04:24,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24 WrapperNode [2024-11-22 06:04:24,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 06:04:24,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 06:04:24,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 06:04:24,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 06:04:24,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,711 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 501 [2024-11-22 06:04:24,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 06:04:24,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 06:04:24,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 06:04:24,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 06:04:24,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,769 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-22 06:04:24,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 06:04:24,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 06:04:24,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 06:04:24,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 06:04:24,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (1/1) ... [2024-11-22 06:04:24,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:04:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:04:24,845 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-22 06:04:24,851 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-22 06:04:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 06:04:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 06:04:24,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 06:04:24,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 06:04:25,048 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 06:04:25,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 06:04:25,492 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-22 06:04:25,492 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 06:04:25,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 06:04:25,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 06:04:25,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:25 BoogieIcfgContainer [2024-11-22 06:04:25,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 06:04:25,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 06:04:25,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 06:04:25,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 06:04:25,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:04:24" (1/3) ... [2024-11-22 06:04:25,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a9cb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:25, skipping insertion in model container [2024-11-22 06:04:25,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:24" (2/3) ... [2024-11-22 06:04:25,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a9cb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:25, skipping insertion in model container [2024-11-22 06:04:25,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:25" (3/3) ... [2024-11-22 06:04:25,513 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2024-11-22 06:04:25,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 06:04:25,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 06:04:25,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 06:04:25,576 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;@133e3e2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 06:04:25,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 06:04:25,580 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-22 06:04:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 06:04:25,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:04:25,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 06:04:25,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:04:25,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:04:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 06:04:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:04:25,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081629925] [2024-11-22 06:04:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:04:25,604 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-22 06:04:25,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:04:25,606 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-22 06:04:25,628 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-22 06:04:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:04:25,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 06:04:25,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:04:25,970 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-22 06:04:25,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:04:25,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:04:25,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081629925] [2024-11-22 06:04:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081629925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:04:25,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:04:25,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 06:04:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640037428] [2024-11-22 06:04:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:04:25,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 06:04:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:04:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 06:04:26,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:04:26,014 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-22 06:04:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:04:26,067 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-22 06:04:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 06:04:26,070 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-22 06:04:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:04:26,077 INFO L225 Difference]: With dead ends: 18 [2024-11-22 06:04:26,077 INFO L226 Difference]: Without dead ends: 10 [2024-11-22 06:04:26,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 06:04:26,086 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:04:26,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:04:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-22 06:04:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-22 06:04:26,113 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-22 06:04:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 06:04:26,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 06:04:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:04:26,115 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 06:04:26,116 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-22 06:04:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 06:04:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 06:04:26,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:04:26,116 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 06:04:26,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 06:04:26,317 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-22 06:04:26,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:04:26,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:04:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 06:04:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:04:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965511988] [2024-11-22 06:04:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:04:26,320 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-22 06:04:26,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:04:26,323 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-22 06:04:26,325 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-22 06:04:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:04:26,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 06:04:26,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:04:27,794 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-22 06:04:27,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:05:05,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse22 (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))) (_ bv0 8)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))))))) (let ((.cse65 (or .cse17 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse69))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse69))))))))))) (.cse13 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))) (.cse43 (let ((.cse68 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse15)))))) (and (or .cse68 .cse22) (or .cse17 (not .cse68))))) (.cse66 (or .cse22 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse67)))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse67))))))))))))) (.cse48 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_55~0#1|))) (let ((.cse51 (= |c_ULTIMATE.start_main_~state_40~0#1| (_ bv0 8))) (.cse35 (not .cse48)) (.cse38 (and .cse65 (or .cse13 .cse43) .cse66)) (.cse4 (forall ((|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) (_ bv0 8)))) (.cse5 (forall ((|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) (_ bv0 8))))) (.cse39 (and .cse65 .cse66))) (and (or (let ((.cse2 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse50)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ 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_21~0#1|)))))))))))) .cse50))))))))))) (.cse14 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))))))) (.cse7 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))))) (.cse8 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse49))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ 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_21~0#1|)))))))))))) .cse49)))))))))))) (and (or (let ((.cse1 (let ((.cse33 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) .cse34)))))))) (and (or .cse33 .cse22) (or .cse17 (not .cse33)))))) (let ((.cse0 (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) ((_ 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_21~0#1|)))))))))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse31))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse32)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse31))) .cse32)))))))))))) (.cse3 (or .cse22 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ 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_21~0#1|))))))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse29)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse30))) .cse29))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse30))))))))) (.cse6 (and (or (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27)))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse27))))))))))))) .cse22) (or .cse1 .cse13) (or .cse17 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse28))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse28)))))))))))) (.cse9 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) ((_ 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_21~0#1|))))))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse25))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26))) .cse25))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse26))))))) .cse22)) (.cse10 (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ 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_21~0#1|)))))))))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse23))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse24))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))) .cse24)))))))))))) (.cse11 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse21)))))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse20)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse21))))))))))) .cse22)) (.cse12 (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse19)))))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse18))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse19)))))))))))))) (and (or (and .cse0 (or .cse1 .cse2) .cse3) .cse4) (or .cse5 (and .cse0 .cse3)) (or .cse5 .cse6 .cse7) (or (and (or .cse1 .cse8) .cse9 .cse10) .cse4) (or .cse5 (and .cse11 .cse12)) (or .cse1 .cse13 .cse7 .cse4) (or .cse14 (and (or .cse1 .cse13 .cse4) (or .cse5 .cse6))) (or .cse5 (and .cse9 .cse10)) (or .cse4 (and .cse11 .cse12 (or .cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse16))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse16)))))))))))))))) .cse35) (or (let ((.cse40 (and (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse45)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse44))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse44))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse45)))))))))))) (or .cse22 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse46 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse47)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse46))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse46)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse47)))))))))))))) (.cse36 (and (or .cse43 .cse4) (or .cse5 .cse43)))) (and (or .cse36 .cse2) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|))))))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse37))))))))) .cse38) (or .cse14 .cse39 .cse4) (or .cse5 .cse40) (or .cse39 .cse7 .cse4) (or .cse40 .cse4) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_80~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|))))))))))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_80~0#1|)))))))) .cse41)))))))))) .cse38) (or .cse36 .cse8) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse42))))))))))))))) (not (= ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse42))))) (_ bv0 8)))))) .cse39))) .cse48))) .cse51) (or (not .cse51) (let ((.cse53 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))))))))) (and (or (let ((.cse52 (let ((.cse55 (let ((.cse56 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|))))))))))) (and (or .cse22 .cse56) (or .cse17 (not .cse56)))))) (and (or .cse5 .cse55) (or .cse55 .cse4))))) (and (or .cse52 .cse53) (or .cse52 .cse13) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse54))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse54)))))))))) .cse52))) .cse35) (or .cse48 (let ((.cse57 (and (or .cse17 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse62 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) .cse62)))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) .cse61))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse61))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse62)))))))))))) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) .cse64)))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse63))))))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) .cse63)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse64))))))))))) .cse22)))) (and (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))))) .cse38) (or .cse39 .cse4) (or .cse5 .cse57) (or .cse4 (and (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) .cse58))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse58))))))))))))) .cse17) (or .cse43 .cse53) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))) (or (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) .cse59)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse59))))))))))))) .cse22))) (or .cse57 .cse4) (or .cse5 .cse43 .cse53) (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_65~0#1| (_ BitVec 8))) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_65~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse60))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))) (not (= ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse60))))) (_ bv0 8)))))) .cse39)))))))))))) is different from false