./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:16:40,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:16:40,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:16:40,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:16:40,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:16:40,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:16:40,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:16:40,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:16:40,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:16:40,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:16:40,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:16:40,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:16:40,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:16:40,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:16:40,489 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:16:40,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:16:40,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:16:40,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:16:40,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:16:40,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:16:40,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:16:40,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:16:40,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:16:40,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:16:40,493 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2025-01-09 08:16:40,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:16:40,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:16:40,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:16:40,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:16:40,717 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:16:40,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-01-09 08:16:41,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33c95bb23/f1b120009107417b81d4d015d5406cf8/FLAGe3d1f61a0 [2025-01-09 08:16:42,098 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:16:42,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-01-09 08:16:42,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33c95bb23/f1b120009107417b81d4d015d5406cf8/FLAGe3d1f61a0 [2025-01-09 08:16:42,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33c95bb23/f1b120009107417b81d4d015d5406cf8 [2025-01-09 08:16:42,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:16:42,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:16:42,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:16:42,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:16:42,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:16:42,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f460129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42, skipping insertion in model container [2025-01-09 08:16:42,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:16:42,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2025-01-09 08:16:42,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:16:42,381 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:16:42,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2025-01-09 08:16:42,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:16:42,464 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:16:42,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42 WrapperNode [2025-01-09 08:16:42,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:16:42,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:16:42,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:16:42,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:16:42,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,544 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 705 [2025-01-09 08:16:42,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:16:42,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:16:42,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:16:42,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:16:42,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,589 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]. [2025-01-09 08:16:42,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:16:42,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:16:42,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:16:42,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:16:42,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (1/1) ... [2025-01-09 08:16:42,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:16:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:42,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:16:42,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:16:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:16:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:16:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:16:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:16:42,802 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:16:42,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:16:43,483 INFO L? ?]: Removed 342 outVars from TransFormulas that were not future-live. [2025-01-09 08:16:43,484 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:16:43,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:16:43,491 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:16:43,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:16:43 BoogieIcfgContainer [2025-01-09 08:16:43,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:16:43,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:16:43,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:16:43,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:16:43,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:16:42" (1/3) ... [2025-01-09 08:16:43,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ccd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:16:43, skipping insertion in model container [2025-01-09 08:16:43,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:42" (2/3) ... [2025-01-09 08:16:43,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ccd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:16:43, skipping insertion in model container [2025-01-09 08:16:43,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:16:43" (3/3) ... [2025-01-09 08:16:43,497 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-01-09 08:16:43,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:16:43,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c that has 1 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:16:43,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:16:43,553 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;@7f0044f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:16:43,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:16:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.4926470588235294) internal successors, (203), 137 states have internal predecessors, (203), 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) [2025-01-09 08:16:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 08:16:43,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:43,560 INFO L218 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] [2025-01-09 08:16:43,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1381663579, now seen corresponding path program 1 times [2025-01-09 08:16:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176539078] [2025-01-09 08:16:43,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:43,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 08:16:43,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 08:16:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:44,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176539078] [2025-01-09 08:16:44,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176539078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:44,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:16:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826420500] [2025-01-09 08:16:44,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:44,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:16:44,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:44,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:16:44,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:16:44,130 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.4926470588235294) internal successors, (203), 137 states have internal predecessors, (203), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-01-09 08:16:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:44,178 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2025-01-09 08:16:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:16:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2025-01-09 08:16:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:44,185 INFO L225 Difference]: With dead ends: 225 [2025-01-09 08:16:44,186 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 08:16:44,188 INFO L434 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 [2025-01-09 08:16:44,190 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 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 [2025-01-09 08:16:44,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:16:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 08:16:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 08:16:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4779411764705883) internal successors, (201), 136 states have internal predecessors, (201), 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) [2025-01-09 08:16:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2025-01-09 08:16:44,219 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 39 [2025-01-09 08:16:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2025-01-09 08:16:44,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-01-09 08:16:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2025-01-09 08:16:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 08:16:44,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:44,221 INFO L218 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] [2025-01-09 08:16:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:16:44,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -116406637, now seen corresponding path program 1 times [2025-01-09 08:16:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118375667] [2025-01-09 08:16:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:44,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 08:16:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 08:16:44,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:44,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:44,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118375667] [2025-01-09 08:16:44,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118375667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:44,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:16:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670616620] [2025-01-09 08:16:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:44,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:16:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:44,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:16:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:16:44,462 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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) [2025-01-09 08:16:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:44,777 INFO L93 Difference]: Finished difference Result 331 states and 482 transitions. [2025-01-09 08:16:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:16:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 40 [2025-01-09 08:16:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:44,778 INFO L225 Difference]: With dead ends: 331 [2025-01-09 08:16:44,778 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 08:16:44,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:16:44,780 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 457 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:44,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 558 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:16:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 08:16:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2025-01-09 08:16:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 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) [2025-01-09 08:16:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-01-09 08:16:44,786 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 40 [2025-01-09 08:16:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:44,786 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-01-09 08:16:44,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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) [2025-01-09 08:16:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-01-09 08:16:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 08:16:44,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:44,787 INFO L218 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] [2025-01-09 08:16:44,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:16:44,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:44,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:44,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1458931238, now seen corresponding path program 1 times [2025-01-09 08:16:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:44,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010565990] [2025-01-09 08:16:44,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:44,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 08:16:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 08:16:44,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:44,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010565990] [2025-01-09 08:16:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010565990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:44,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:16:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535785967] [2025-01-09 08:16:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:16:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:44,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:16:44,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:16:44,963 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2025-01-09 08:16:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:44,992 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2025-01-09 08:16:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:16:44,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-01-09 08:16:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:44,994 INFO L225 Difference]: With dead ends: 232 [2025-01-09 08:16:44,995 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 08:16:44,996 INFO L434 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 [2025-01-09 08:16:44,996 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 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 [2025-01-09 08:16:44,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:16:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 08:16:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-01-09 08:16:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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) [2025-01-09 08:16:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-01-09 08:16:45,007 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 41 [2025-01-09 08:16:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:45,007 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-01-09 08:16:45,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2025-01-09 08:16:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-01-09 08:16:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 08:16:45,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:45,010 INFO L218 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] [2025-01-09 08:16:45,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:16:45,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1179229697, now seen corresponding path program 1 times [2025-01-09 08:16:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036611685] [2025-01-09 08:16:45,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:16:45,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:16:45,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036611685] [2025-01-09 08:16:45,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036611685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:45,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:45,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:16:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671884169] [2025-01-09 08:16:45,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:45,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:16:45,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:45,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:16:45,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:16:45,338 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2025-01-09 08:16:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:45,360 INFO L93 Difference]: Finished difference Result 234 states and 340 transitions. [2025-01-09 08:16:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:16:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-01-09 08:16:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:45,361 INFO L225 Difference]: With dead ends: 234 [2025-01-09 08:16:45,361 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 08:16:45,362 INFO L434 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 [2025-01-09 08:16:45,364 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 5 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:45,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 569 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:16:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 08:16:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-01-09 08:16:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4583333333333333) internal successors, (210), 144 states have internal predecessors, (210), 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) [2025-01-09 08:16:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2025-01-09 08:16:45,375 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 42 [2025-01-09 08:16:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:45,375 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2025-01-09 08:16:45,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2025-01-09 08:16:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2025-01-09 08:16:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 08:16:45,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:45,378 INFO L218 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] [2025-01-09 08:16:45,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:16:45,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:45,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1189698035, now seen corresponding path program 1 times [2025-01-09 08:16:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39360800] [2025-01-09 08:16:45,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:45,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 08:16:45,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 08:16:45,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:45,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39360800] [2025-01-09 08:16:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39360800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:16:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602747995] [2025-01-09 08:16:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:16:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:16:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:16:45,797 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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) [2025-01-09 08:16:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:45,880 INFO L93 Difference]: Finished difference Result 246 states and 354 transitions. [2025-01-09 08:16:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:16:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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 [2025-01-09 08:16:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:45,881 INFO L225 Difference]: With dead ends: 246 [2025-01-09 08:16:45,881 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 08:16:45,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:16:45,882 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 187 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:45,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1129 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:16:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 08:16:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-01-09 08:16:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 155 states have internal predecessors, (224), 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) [2025-01-09 08:16:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 224 transitions. [2025-01-09 08:16:45,887 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 224 transitions. Word has length 43 [2025-01-09 08:16:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:45,888 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 224 transitions. [2025-01-09 08:16:45,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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) [2025-01-09 08:16:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 224 transitions. [2025-01-09 08:16:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:16:45,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:45,888 INFO L218 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] [2025-01-09 08:16:45,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:16:45,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2093413086, now seen corresponding path program 1 times [2025-01-09 08:16:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:45,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677056981] [2025-01-09 08:16:45,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:45,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:16:45,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:16:45,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:45,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677056981] [2025-01-09 08:16:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677056981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:46,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:16:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912744199] [2025-01-09 08:16:46,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:46,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:16:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:46,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:16:46,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:16:46,439 INFO L87 Difference]: Start difference. First operand 156 states and 224 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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) [2025-01-09 08:16:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:46,635 INFO L93 Difference]: Finished difference Result 259 states and 371 transitions. [2025-01-09 08:16:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:16:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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 [2025-01-09 08:16:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:46,636 INFO L225 Difference]: With dead ends: 259 [2025-01-09 08:16:46,636 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 08:16:46,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:16:46,637 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 192 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:46,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1216 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:16:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 08:16:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-01-09 08:16:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.440251572327044) internal successors, (229), 159 states have internal predecessors, (229), 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) [2025-01-09 08:16:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2025-01-09 08:16:46,641 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 44 [2025-01-09 08:16:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:46,645 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2025-01-09 08:16:46,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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) [2025-01-09 08:16:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2025-01-09 08:16:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:16:46,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:46,648 INFO L218 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] [2025-01-09 08:16:46,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:16:46,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:46,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1157382943, now seen corresponding path program 1 times [2025-01-09 08:16:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:46,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915408985] [2025-01-09 08:16:46,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:46,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:16:46,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:16:46,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:46,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:16:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915408985] [2025-01-09 08:16:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915408985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:46,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:46,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:16:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658873357] [2025-01-09 08:16:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:46,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:16:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:16:46,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:16:46,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:16:46,771 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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) [2025-01-09 08:16:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:46,825 INFO L93 Difference]: Finished difference Result 335 states and 476 transitions. [2025-01-09 08:16:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:16:46,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 [2025-01-09 08:16:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:46,826 INFO L225 Difference]: With dead ends: 335 [2025-01-09 08:16:46,826 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 08:16:46,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:16:46,827 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 372 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:46,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 555 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:16:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 08:16:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 156. [2025-01-09 08:16:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 155 states have internal predecessors, (223), 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) [2025-01-09 08:16:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 223 transitions. [2025-01-09 08:16:46,831 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 223 transitions. Word has length 44 [2025-01-09 08:16:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:46,831 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 223 transitions. [2025-01-09 08:16:46,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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) [2025-01-09 08:16:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 223 transitions. [2025-01-09 08:16:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:16:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:46,832 INFO L218 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] [2025-01-09 08:16:46,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:16:46,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2035841548, now seen corresponding path program 1 times [2025-01-09 08:16:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:16:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622374004] [2025-01-09 08:16:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:16:46,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:16:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:16:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:16:46,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:16:46,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:16:46,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:16:46,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:46,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:16:46,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:16:46,922 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:16:46,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:16:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:16:46,926 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:46,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:16:46,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:16:46 BoogieIcfgContainer [2025-01-09 08:16:46,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:16:46,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:16:46,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:16:46,975 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:16:46,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:16:43" (3/4) ... [2025-01-09 08:16:46,977 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:16:46,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:16:46,979 INFO L158 Benchmark]: Toolchain (without parser) took 4841.05ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 134.8MB in the beginning and 139.0MB in the end (delta: -4.1MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,979 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:16:46,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.22ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 114.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.05ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 101.1MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,980 INFO L158 Benchmark]: Boogie Preprocessor took 91.20ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 92.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,980 INFO L158 Benchmark]: RCFGBuilder took 854.88ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 99.6MB in the end (delta: -7.1MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,980 INFO L158 Benchmark]: TraceAbstraction took 3481.52ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 98.7MB in the beginning and 139.0MB in the end (delta: -40.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,981 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 218.1MB. Free memory was 139.0MB in the beginning and 139.0MB in the end (delta: 42.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:16:46,981 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.22ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 114.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.05ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 101.1MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.20ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 92.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 854.88ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 99.6MB in the end (delta: -7.1MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3481.52ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 98.7MB in the beginning and 139.0MB in the end (delta: -40.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 218.1MB. Free memory was 139.0MB in the beginning and 139.0MB in the end (delta: 42.0kB). Peak memory consumption was 8.4MB. 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 bitwiseOr at line 162, overapproximation of bitwiseAnd at line 167. 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_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 4); [L36] const SORT_18 msb_SORT_18 = (SORT_18)1 << (4 - 1); [L38] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 10); [L39] const SORT_71 msb_SORT_71 = (SORT_71)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 1; [L43] const SORT_1 var_15 = 1; [L44] const SORT_18 var_20 = 1; [L45] const SORT_71 var_72 = 0; [L46] const SORT_10 var_81 = 104; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_32; [L53] SORT_18 input_34; [L54] SORT_1 input_36; [L55] SORT_18 input_38; [L56] SORT_1 input_40; [L57] SORT_1 input_42; [L58] SORT_1 input_48; [L59] SORT_1 input_50; [L60] SORT_1 input_52; [L61] SORT_3 input_54; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_1 input_75; [L65] SORT_1 input_76; [L66] SORT_1 input_77; [L67] SORT_1 input_89; [L68] SORT_1 input_90; [L69] SORT_1 input_91; [L70] SORT_1 input_102; [L71] SORT_1 input_108; [L72] SORT_1 input_114; [L73] SORT_1 input_125; [L74] SORT_1 input_127; [L75] SORT_71 input_142; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L78] SORT_1 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L79] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L80] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L81] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L82] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L83] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L84] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L85] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L86] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L87] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_71 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L88] SORT_71 state_73 = __VERIFIER_nondet_ushort() & mask_SORT_71; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_17_arg_1 = var_15; [L93] state_16 = init_17_arg_1 [L94] SORT_1 init_29_arg_1 = var_7; [L95] state_28 = init_29_arg_1 [L96] SORT_1 init_31_arg_1 = var_7; [L97] state_30 = init_31_arg_1 [L98] SORT_1 init_45_arg_1 = var_7; [L99] state_44 = init_45_arg_1 [L100] SORT_1 init_47_arg_1 = var_7; [L101] state_46 = init_47_arg_1 [L102] SORT_1 init_60_arg_1 = var_7; [L103] state_59 = init_60_arg_1 [L104] SORT_1 init_62_arg_1 = var_7; [L105] state_61 = init_62_arg_1 [L106] SORT_1 init_64_arg_1 = var_7; [L107] state_63 = init_64_arg_1 [L108] SORT_1 init_66_arg_1 = var_7; [L109] state_65 = init_66_arg_1 [L110] SORT_1 init_70_arg_1 = var_7; [L111] state_69 = init_70_arg_1 [L112] SORT_71 init_74_arg_1 = var_72; [L113] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_32 = __VERIFIER_nondet_uchar() [L121] input_34 = __VERIFIER_nondet_uchar() [L122] input_36 = __VERIFIER_nondet_uchar() [L123] input_38 = __VERIFIER_nondet_uchar() [L124] input_40 = __VERIFIER_nondet_uchar() [L125] input_42 = __VERIFIER_nondet_uchar() [L126] input_48 = __VERIFIER_nondet_uchar() [L127] input_50 = __VERIFIER_nondet_uchar() [L128] input_52 = __VERIFIER_nondet_uchar() [L129] input_54 = __VERIFIER_nondet_uchar() [L130] input_57 = __VERIFIER_nondet_uchar() [L131] input_67 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_76 = __VERIFIER_nondet_uchar() [L134] input_77 = __VERIFIER_nondet_uchar() [L135] input_89 = __VERIFIER_nondet_uchar() [L136] input_90 = __VERIFIER_nondet_uchar() [L137] input_91 = __VERIFIER_nondet_uchar() [L138] input_102 = __VERIFIER_nondet_uchar() [L139] input_108 = __VERIFIER_nondet_uchar() [L140] input_114 = __VERIFIER_nondet_uchar() [L141] input_125 = __VERIFIER_nondet_uchar() [L142] input_127 = __VERIFIER_nondet_uchar() [L143] input_142 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_11_arg_0=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_19_arg_0 = state_16; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_19_arg_0=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] EXPR var_19_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] var_19_arg_0 = var_19_arg_0 & mask_SORT_1 [L156] SORT_18 var_19 = var_19_arg_0; [L157] SORT_18 var_21_arg_0 = var_19; [L158] SORT_18 var_21_arg_1 = var_20; [L159] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L160] SORT_1 var_22_arg_0 = var_14; [L161] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_22_arg_0=-1, var_22_arg_1=1, var_72=0, var_7=0, var_81=104] [L162] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L162] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L163] SORT_1 var_25_arg_0 = var_22; [L164] SORT_1 var_25 = ~var_25_arg_0; [L165] SORT_1 var_26_arg_0 = var_15; [L166] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_26_arg_0=1, var_26_arg_1=-1, var_72=0, var_7=0, var_81=104] [L167] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L167] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L168] EXPR var_26 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L168] var_26 = var_26 & mask_SORT_1 [L169] SORT_1 bad_27_arg_0 = var_26; [L170] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1213 mSDsluCounter, 5193 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3885 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1308 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 104 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 08:16:47,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:16:48,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:16:49,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:16:49,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:16:49,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:16:49,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:16:49,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:16:49,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:16:49,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:16:49,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:16:49,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:16:49,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:16:49,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:16:49,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:16:49,109 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:16:49,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:16:49,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:16:49,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:16:49,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:16:49,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:16:49,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:16:49,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:16:49,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:16:49,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:16:49,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:16:49,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:16:49,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:16:49,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:16:49,114 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2025-01-09 08:16:49,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:16:49,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:16:49,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:16:49,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:16:49,398 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:16:49,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-01-09 08:16:50,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc55ae1a9/9db8d00ca4b847f68340c52ec339792c/FLAG644fc68fd [2025-01-09 08:16:50,877 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:16:50,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-01-09 08:16:50,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc55ae1a9/9db8d00ca4b847f68340c52ec339792c/FLAG644fc68fd [2025-01-09 08:16:50,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc55ae1a9/9db8d00ca4b847f68340c52ec339792c [2025-01-09 08:16:50,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:16:50,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:16:50,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:16:50,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:16:50,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:16:50,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:16:50" (1/1) ... [2025-01-09 08:16:50,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4612683e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:50, skipping insertion in model container [2025-01-09 08:16:50,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:16:50" (1/1) ... [2025-01-09 08:16:50,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:16:51,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2025-01-09 08:16:51,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:16:51,153 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:16:51,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2025-01-09 08:16:51,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:16:51,237 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:16:51,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51 WrapperNode [2025-01-09 08:16:51,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:16:51,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:16:51,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:16:51,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:16:51,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,291 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 449 [2025-01-09 08:16:51,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:16:51,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:16:51,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:16:51,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:16:51,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,327 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]. [2025-01-09 08:16:51,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:16:51,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:16:51,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:16:51,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:16:51,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (1/1) ... [2025-01-09 08:16:51,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:16:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:51,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:16:51,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:16:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:16:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:16:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:16:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:16:51,534 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:16:51,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:16:51,852 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-01-09 08:16:51,852 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:16:51,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:16:51,860 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:16:51,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:16:51 BoogieIcfgContainer [2025-01-09 08:16:51,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:16:51,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:16:51,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:16:51,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:16:51,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:16:50" (1/3) ... [2025-01-09 08:16:51,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8b954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:16:51, skipping insertion in model container [2025-01-09 08:16:51,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:16:51" (2/3) ... [2025-01-09 08:16:51,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8b954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:16:51, skipping insertion in model container [2025-01-09 08:16:51,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:16:51" (3/3) ... [2025-01-09 08:16:51,872 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-01-09 08:16:51,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:16:51,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:16:51,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:16:51,933 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;@64d2c126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:16:51,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:16:51,938 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) [2025-01-09 08:16:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:16:51,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:51,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:16:51,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:16:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:16:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862523938] [2025-01-09 08:16:51,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:51,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:16:51,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:16:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:16:52,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:16:52,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:52,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:52,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 08:16:52,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:52,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:16:52,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:16:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862523938] [2025-01-09 08:16:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862523938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:16:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:16:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:16:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824918124] [2025-01-09 08:16:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:16:52,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:16:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:16:52,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:16:52,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:16:52,357 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) [2025-01-09 08:16:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:52,412 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 08:16:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:16:52,416 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 [2025-01-09 08:16:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:52,420 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:16:52,421 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 08:16:52,423 INFO L434 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 [2025-01-09 08:16:52,425 INFO L435 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 [2025-01-09 08:16:52,425 INFO L436 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] [2025-01-09 08:16:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 08:16:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 08:16:52,446 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) [2025-01-09 08:16:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:16:52,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:16:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:52,450 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:16:52,451 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) [2025-01-09 08:16:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:16:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:16:52,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:52,452 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:16:52,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:16:52,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:52,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:52,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:16:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:16:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1659758676] [2025-01-09 08:16:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:16:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:52,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:16:52,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:16:52,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:16:52,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:16:52,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:16:52,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:52,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 08:16:52,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:52,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:16:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:53,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:16:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659758676] [2025-01-09 08:16:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659758676] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:16:53,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:16:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 08:16:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501547212] [2025-01-09 08:16:53,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:16:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:16:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:16:53,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:16:53,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:16:53,458 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:16:53,614 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-01-09 08:16:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:16:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 08:16:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:16:53,615 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:16:53,615 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 08:16:53,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:16:53,616 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:16:53,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:16:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 08:16:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-01-09 08:16:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-01-09 08:16:53,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-01-09 08:16:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:16:53,622 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-01-09 08:16:53,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:16:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-01-09 08:16:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 08:16:53,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:16:53,623 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-01-09 08:16:53,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:16:53,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:53,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:16:53,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:16:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2025-01-09 08:16:53,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:16:53,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479871255] [2025-01-09 08:16:53,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:16:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:16:53,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:16:53,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:16:53,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:16:53,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 08:16:54,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 08:16:54,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:16:54,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:16:54,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 08:16:54,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:16:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:16:54,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:17:39,281 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse67 ((_ 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_15~0#1|))))))))) (let ((.cse121 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse67))))))))))) (let ((.cse76 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_20~0#1|)) (.cse85 ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_71~0#1|)) (.cse119 ((_ zero_extend 24) ((_ extract 7 0) .cse121))) (.cse116 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_16~0#1|))))) (let ((.cse95 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse116)))))) (.cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse119 .cse32)))) (.cse86 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_72~0#1|))))))) .cse85)))) (.cse75 (forall ((|v_ULTIMATE.start_main_~var_22_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_26_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_22_arg_0~0#1_17|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_26_arg_0~0#1_17|))))))))) (.cse120 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse121))))) (.cse74 (forall ((|v_ULTIMATE.start_main_~var_22_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_26_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_22_arg_0~0#1_17|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_26_arg_0~0#1_17|)))))))))) (let ((.cse70 (or .cse120 .cse74)) (.cse72 (or (not .cse120) .cse75)) (.cse78 (bvugt .cse86 |c_ULTIMATE.start_main_~var_81~0#1|)) (.cse118 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse80 .cse32))))) (.cse94 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_73~0#1|)) (.cse99 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse95))))))) (let ((.cse115 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse99)))))))) (.cse114 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_63~0#1|)))))) (.cse101 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse94 .cse85)))) (.cse81 (or .cse118 .cse74)) (.cse68 (not .cse78)) (.cse88 (and .cse70 .cse72)) (.cse89 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse119)))))))) (.cse82 (or (not .cse118) .cse75))) (let ((.cse18 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 .cse67)))) (.cse19 (and .cse81 (or .cse68 .cse88) (or (let ((.cse117 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse32)))))) (and (or .cse117 .cse74) (or (not .cse117) .cse75))) .cse78) .cse82)) (.cse105 (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|))) (.cse107 (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|)))) (.cse108 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse116)))))))))) (.cse37 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse114 .cse32)))) (.cse21 (bvugt .cse101 |c_ULTIMATE.start_main_~var_81~0#1|)) (.cse96 (or .cse115 .cse74)) (.cse98 (or (not .cse115) .cse75))) (let ((.cse48 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse114)))))))) (.cse20 (and .cse96 .cse98 .cse70 .cse72)) (.cse17 (not .cse21)) (.cse9 (= |c_ULTIMATE.start_main_~state_63~0#1| (_ bv0 8))) (.cse39 (not .cse37)) (.cse46 (let ((.cse112 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse108))))))) (let ((.cse113 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse112))))))))) (let ((.cse109 (or (not .cse113) .cse75)) (.cse110 (or .cse113 .cse74))) (and (or (let ((.cse111 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse112)))))))))) .cse76))) (and .cse109 .cse110 (or .cse111 .cse74) (or (not .cse111) .cse75))) .cse105) (or .cse107 (and .cse109 .cse70 .cse110 .cse72))))))) (.cse45 (let ((.cse103 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse108))))))))))) (let ((.cse106 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse103))))))))) (and (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (let ((.cse100 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))))) (or (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse100 |ULTIMATE.start_main_~var_12~0#1|))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|) (bvugt .cse100 |c_ULTIMATE.start_main_~var_81~0#1|)))) (let ((.cse102 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse103)))) .cse32))))))))) (and (or (not .cse102) .cse75) (or .cse74 .cse102)))) (or .cse88 (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (let ((.cse104 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))))) (or (bvugt .cse104 |c_ULTIMATE.start_main_~var_81~0#1|) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse104 |ULTIMATE.start_main_~var_12~0#1|))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|)))))) (or .cse105 .cse74 .cse106) (or .cse105 (not .cse106) .cse75) (or .cse107 .cse19))))) (.cse63 (not .cse18)) (.cse23 (let ((.cse97 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse99))))))))))))) (and .cse96 (or .cse75 (not .cse97)) (or .cse97 .cse74) .cse98))) (.cse52 (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse95))))))))))) (let ((.cse93 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse92 .cse32)))))))) (.cse90 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) .cse94)) .cse85))))) (and (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse90))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|)) (let ((.cse91 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse92))))))))))))) (and (or (not .cse91) .cse75) (or .cse91 .cse74)))) (or .cse93 .cse74) (or (not .cse93) .cse75) (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse90))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|))) .cse88)))))) (let ((.cse5 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_59~0#1|)) (.cse22 (and (or .cse63 .cse23) (or .cse18 .cse52))) (.cse41 (and (or .cse63 .cse46) (or .cse18 .cse45))) (.cse42 (and (or .cse37 .cse45) (or .cse39 .cse46))) (.cse10 (not .cse9)) (.cse11 (and (or .cse23 .cse21) (or .cse20 .cse17))) (.cse38 (and (or (and .cse81 .cse70 .cse82 .cse72) .cse68) (or (let ((.cse84 ((_ zero_extend 24) ((_ extract 7 0) .cse89)))) (let ((.cse87 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse84))) .cse32)))))) (and (or (let ((.cse83 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse84))))))))))))) (and (or .cse83 .cse74) (or (not .cse83) .cse75))) (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse86)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|))) (or .cse74 .cse87) (or (not .cse87) .cse75) (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse86)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|))) .cse88)))) .cse78))) (.cse47 (not .cse48)) (.cse40 (let ((.cse77 ((_ zero_extend 24) ((_ extract 7 0) .cse80)))) (let ((.cse79 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse77))))))))) (let ((.cse69 (or .cse79 .cse74)) (.cse71 (or (not .cse79) .cse75))) (and (or .cse68 (and .cse69 .cse70 .cse71 .cse72)) (or (let ((.cse73 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse77))))))))))))) (and (or .cse73 .cse74) .cse69 (or (not .cse73) .cse75) .cse71)) .cse78))))))) (let ((.cse14 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse7 (and (or .cse21 (and (or .cse48 .cse45) (or .cse46 .cse47))) (or (and (or .cse48 .cse38) (or .cse47 .cse40)) .cse17))) (.cse56 (or .cse10 .cse11)) (.cse8 (and (or .cse42 .cse21) (or (and (or .cse39 .cse40) (or .cse37 .cse38)) .cse17))) (.cse16 (and (or (and (or .cse63 .cse40) (or .cse18 .cse38)) .cse17) (or .cse41 .cse21))) (.cse24 (and (or .cse22 .cse21) (or .cse17 (and (or .cse63 .cse20) (or .cse18 .cse19))))) (.cse3 (not .cse5)) (.cse55 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse67))))) (let ((.cse13 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse66 ((_ 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 ((_ 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_69~0#1|)))))))) .cse66))) .cse32)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse66 ((_ 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_127~0#1|))))))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse66))))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse65 ((_ 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 ((_ 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_69~0#1|)))))))) .cse65))) .cse32)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse65 ((_ 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_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse65)))))))))) (.cse26 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse64 ((_ 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 ((_ 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_69~0#1|)))))))) .cse64))) .cse32)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse64 ((_ 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_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse64)))))))))) (.cse12 (let ((.cse62 (= ((_ extract 7 0) (bvand .cse32 .cse55)) (_ bv0 8)))) (let ((.cse60 (and (or (not .cse62) .cse3) (or .cse63 .cse5))) (.cse61 (and (or .cse62 .cse3) (or .cse18 .cse5)))) (and (or .cse10 (and (or (and (or .cse60 .cse23) (or .cse61 .cse52)) .cse21) (or (and (or .cse61 .cse19) (or .cse60 .cse20)) .cse17))) (or (and (or .cse21 (and (or .cse60 .cse46) (or .cse61 .cse45))) (or .cse17 (and (or .cse60 .cse40) (or .cse61 .cse38)))) .cse9))))) (.cse15 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse59 ((_ 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 ((_ 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_69~0#1|)))))))) .cse59))) .cse32)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 ((_ 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_127~0#1|)))))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse59))))))))))) (.cse6 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse58 ((_ 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_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ 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_69~0#1|)))))))) .cse58))) .cse32))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse58))))))))))) (.cse4 (and (or .cse16 .cse9) (or .cse10 .cse24))) (.cse27 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse57 ((_ 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 .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 ((_ 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_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ 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_69~0#1|)))))))) .cse57))) .cse32))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse57))))))))))) (.cse2 (and .cse56 (or .cse9 .cse8))) (.cse28 (forall ((|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) (_ bv0 8)))) (.cse29 (and .cse56 (or .cse7 .cse9))) (.cse0 (not .cse14)) (.cse25 (let ((.cse53 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse55))))))))) (let ((.cse54 (not .cse53))) (and (or (and (or .cse21 (and (or .cse52 .cse53) (or .cse54 .cse23))) (or (and (or .cse53 .cse19) (or .cse54 .cse20)) .cse17)) .cse10) (or (and (or .cse17 (and (or .cse54 .cse40) (or .cse53 .cse38))) (or .cse21 (and (or .cse53 .cse45) (or .cse54 .cse46)))) .cse9)))))) (and (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5))) (or .cse0 (and (or (and (or .cse6 .cse7 .cse5) (or .cse6 .cse3 .cse8)) .cse9) (or .cse10 (and (or .cse6 .cse11 .cse5) (or .cse6 .cse11 .cse3))))) (or .cse12 .cse13 .cse14) (or .cse0 (and (or (and (or .cse15 .cse3 .cse8) (or .cse15 .cse16 .cse5)) .cse9) (or .cse10 (and (or .cse17 (and (or .cse15 .cse18 .cse5 .cse19) (or .cse15 .cse20 .cse3))) (or .cse21 (and (or .cse15 .cse22 .cse5) (or .cse15 .cse23 .cse3))))))) (or .cse6 .cse12 .cse14) (or (and (or (and (or .cse16 .cse5 .cse13) (or .cse3 .cse13 .cse8)) .cse9) (or .cse10 (and (or .cse24 .cse5 .cse13) (or .cse11 .cse3 .cse13)))) .cse0) (or .cse25 .cse26 .cse14) (or .cse12 .cse27 .cse14) (or .cse1 .cse25 .cse14) (or .cse0 (let ((.cse31 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|))))) (or (not (= ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse35))))) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse35))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse32))))))) (.cse30 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse33 ((_ 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_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse33))))))))))) (and (or (and (or .cse28 .cse29 .cse30) (or .cse31 .cse29)) .cse5) (or (and (or (and (or .cse28 .cse11 .cse30) (or .cse11 .cse31)) .cse10) (or .cse9 (and (or .cse31 .cse8) (or .cse28 .cse30 .cse8)))) .cse3)))) (or (and (or .cse4 .cse5 .cse26) (or .cse2 .cse3 .cse26)) .cse0) (or .cse12 .cse15 .cse14) (or .cse25 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse36 ((_ 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 .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 ((_ 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_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ 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_69~0#1|)))))))) .cse36))) .cse32))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse36))))))))) .cse14) (or (and (or .cse10 (and (or .cse21 (and (or .cse6 .cse22 .cse5) (or .cse6 .cse23 .cse3))) (or (and (or .cse6 .cse20 .cse3) (or .cse6 .cse18 .cse5 .cse19)) .cse17))) (or (and (or (and (or (and (or .cse6 .cse18 .cse5) (or .cse6 .cse37 .cse3)) .cse38) (or .cse6 .cse39 .cse3 .cse40)) .cse17) (or .cse21 (and (or .cse6 .cse41 .cse5) (or .cse6 .cse42 .cse3)))) .cse9)) .cse0) (or .cse0 (and (or .cse27 .cse4 .cse5) (or .cse27 .cse2 .cse3))) (or (and (or (let ((.cse44 (and (or .cse27 .cse48 .cse5) (or .cse27 .cse37 .cse3))) (.cse43 (and (or .cse27 .cse47 .cse5) (or .cse27 .cse39 .cse3)))) (and (or (and (or .cse43 .cse40) (or .cse44 .cse38)) .cse17) (or (and (or .cse44 .cse45) (or .cse43 .cse46)) .cse21))) .cse9) (or .cse10 (and (or (and (or .cse27 .cse5) (or .cse27 .cse3)) .cse20 .cse17) (or .cse21 (and (or .cse27 .cse23 .cse3) (or .cse27 .cse23 .cse5)))))) .cse0) (or (let ((.cse49 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8))) (let ((.cse50 ((_ 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 .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 ((_ 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_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse50))))))))))) (and (or .cse28 .cse2 .cse3 .cse49) (or .cse28 .cse29 .cse5 .cse49))) .cse0) (or .cse25 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse51 ((_ 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_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ 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_69~0#1|)))))))) .cse51))) .cse32))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse51))))))))) .cse14))))))))))))) is different from false