./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:53:57,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:53:57,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 07:53:57,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:53:57,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:53:57,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:53:57,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:53:57,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:53:57,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:53:57,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:53:57,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:53:57,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:53:57,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:53:57,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:53:57,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:53:57,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:53:57,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:53:57,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:53:57,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:53:57,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:53:57,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:53:57,656 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/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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2025-03-08 07:53:57,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:53:57,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:53:57,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:53:57,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:53:57,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:53:57,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-08 07:53:59,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b8bc638/5b5f85bb0d7249ad8f5e70f1946bc071/FLAG1913df487 [2025-03-08 07:53:59,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:53:59,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-08 07:53:59,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b8bc638/5b5f85bb0d7249ad8f5e70f1946bc071/FLAG1913df487 [2025-03-08 07:53:59,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b8bc638/5b5f85bb0d7249ad8f5e70f1946bc071 [2025-03-08 07:53:59,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:53:59,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:53:59,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:53:59,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:53:59,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:53:59,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:53:59" (1/1) ... [2025-03-08 07:53:59,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:59, skipping insertion in model container [2025-03-08 07:53:59,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:53:59" (1/1) ... [2025-03-08 07:53:59,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:53:59,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-08 07:53:59,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:53:59,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:53:59,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-08 07:54:00,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:54:00,032 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:54:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00 WrapperNode [2025-03-08 07:54:00,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:54:00,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:54:00,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:54:00,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:54:00,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,451 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5233 [2025-03-08 07:54:00,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:54:00,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:54:00,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:54:00,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:54:00,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,642 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-03-08 07:54:00,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:54:00,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:54:00,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:54:00,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:54:00,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (1/1) ... [2025-03-08 07:54:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:54:00,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:00,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:54:01,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:54:01,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:54:01,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:54:01,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:54:01,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:54:01,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:54:01,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:54:05,513 INFO L? ?]: Removed 2933 outVars from TransFormulas that were not future-live. [2025-03-08 07:54:05,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:54:05,679 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:54:05,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:54:05,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:54:05 BoogieIcfgContainer [2025-03-08 07:54:05,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:54:05,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:54:05,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:54:05,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:54:05,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:53:59" (1/3) ... [2025-03-08 07:54:05,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5d31f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:54:05, skipping insertion in model container [2025-03-08 07:54:05,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:00" (2/3) ... [2025-03-08 07:54:05,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5d31f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:54:05, skipping insertion in model container [2025-03-08 07:54:05,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:54:05" (3/3) ... [2025-03-08 07:54:05,688 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-08 07:54:05,704 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:54:05,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c that has 1 procedures, 1802 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 07:54:05,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:54:05,819 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;@11f04825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:54:05,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:54:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 1802 states, 1800 states have (on average 1.4994444444444444) internal successors, (2699), 1801 states have internal predecessors, (2699), 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-03-08 07:54:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 07:54:05,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:05,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:05,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:05,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1076487480, now seen corresponding path program 1 times [2025-03-08 07:54:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:05,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203850852] [2025-03-08 07:54:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:05,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:54:06,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:54:06,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:06,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:06,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:54:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203850852] [2025-03-08 07:54:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203850852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:06,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:06,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:54:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805358199] [2025-03-08 07:54:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:06,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:54:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:54:06,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:54:06,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:54:06,692 INFO L87 Difference]: Start difference. First operand has 1802 states, 1800 states have (on average 1.4994444444444444) internal successors, (2699), 1801 states have internal predecessors, (2699), 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 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-03-08 07:54:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:07,668 INFO L93 Difference]: Finished difference Result 3489 states and 5229 transitions. [2025-03-08 07:54:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:54:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2025-03-08 07:54:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:07,687 INFO L225 Difference]: With dead ends: 3489 [2025-03-08 07:54:07,688 INFO L226 Difference]: Without dead ends: 1801 [2025-03-08 07:54:07,697 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-03-08 07:54:07,698 INFO L435 NwaCegarLoop]: 2245 mSDtfsCounter, 0 mSDsluCounter, 4485 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6730 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:07,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6730 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:54:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-03-08 07:54:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2025-03-08 07:54:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.4983333333333333) internal successors, (2697), 1800 states have internal predecessors, (2697), 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-03-08 07:54:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2697 transitions. [2025-03-08 07:54:07,773 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2697 transitions. Word has length 107 [2025-03-08 07:54:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:07,774 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2697 transitions. [2025-03-08 07:54:07,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-03-08 07:54:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2697 transitions. [2025-03-08 07:54:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 07:54:07,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:07,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:07,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:54:07,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:07,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 993308412, now seen corresponding path program 1 times [2025-03-08 07:54:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210281535] [2025-03-08 07:54:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 07:54:07,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 07:54:07,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:07,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:54:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210281535] [2025-03-08 07:54:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210281535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:08,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:54:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035362119] [2025-03-08 07:54:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:54:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:54:08,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:54:08,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:54:08,143 INFO L87 Difference]: Start difference. First operand 1801 states and 2697 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-03-08 07:54:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:09,142 INFO L93 Difference]: Finished difference Result 3490 states and 5227 transitions. [2025-03-08 07:54:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:54:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2025-03-08 07:54:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:09,150 INFO L225 Difference]: With dead ends: 3490 [2025-03-08 07:54:09,150 INFO L226 Difference]: Without dead ends: 1803 [2025-03-08 07:54:09,152 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-03-08 07:54:09,153 INFO L435 NwaCegarLoop]: 2245 mSDtfsCounter, 0 mSDsluCounter, 4482 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6727 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:09,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6727 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:54:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-08 07:54:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2025-03-08 07:54:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1802 states have (on average 1.497780244173141) internal successors, (2699), 1802 states have internal predecessors, (2699), 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-03-08 07:54:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2699 transitions. [2025-03-08 07:54:09,185 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2699 transitions. Word has length 108 [2025-03-08 07:54:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:09,186 INFO L471 AbstractCegarLoop]: Abstraction has 1803 states and 2699 transitions. [2025-03-08 07:54:09,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-03-08 07:54:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2699 transitions. [2025-03-08 07:54:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 07:54:09,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:09,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:54:09,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:09,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1635665597, now seen corresponding path program 1 times [2025-03-08 07:54:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52709030] [2025-03-08 07:54:09,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:09,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 07:54:09,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 07:54:09,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:09,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:09,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:54:09,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52709030] [2025-03-08 07:54:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52709030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:09,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:09,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:54:09,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898005803] [2025-03-08 07:54:09,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:54:09,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:54:09,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:54:09,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:54:09,386 INFO L87 Difference]: Start difference. First operand 1803 states and 2699 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-03-08 07:54:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:10,050 INFO L93 Difference]: Finished difference Result 3494 states and 5231 transitions. [2025-03-08 07:54:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:54:10,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 109 [2025-03-08 07:54:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:10,058 INFO L225 Difference]: With dead ends: 3494 [2025-03-08 07:54:10,059 INFO L226 Difference]: Without dead ends: 1805 [2025-03-08 07:54:10,062 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-03-08 07:54:10,063 INFO L435 NwaCegarLoop]: 2245 mSDtfsCounter, 0 mSDsluCounter, 4477 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:10,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6722 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:54:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-03-08 07:54:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2025-03-08 07:54:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1804 states have (on average 1.497228381374723) internal successors, (2701), 1804 states have internal predecessors, (2701), 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-03-08 07:54:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2701 transitions. [2025-03-08 07:54:10,093 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2701 transitions. Word has length 109 [2025-03-08 07:54:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2701 transitions. [2025-03-08 07:54:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-03-08 07:54:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2701 transitions. [2025-03-08 07:54:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 07:54:10,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:10,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:10,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:54:10,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1572627967, now seen corresponding path program 1 times [2025-03-08 07:54:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683184016] [2025-03-08 07:54:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:10,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 07:54:10,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 07:54:10,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:10,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:54:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683184016] [2025-03-08 07:54:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683184016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:10,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:54:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503652795] [2025-03-08 07:54:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:10,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:54:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:54:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:54:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:54:10,316 INFO L87 Difference]: Start difference. First operand 1805 states and 2701 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-03-08 07:54:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:11,084 INFO L93 Difference]: Finished difference Result 3504 states and 5243 transitions. [2025-03-08 07:54:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:54:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2025-03-08 07:54:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:11,093 INFO L225 Difference]: With dead ends: 3504 [2025-03-08 07:54:11,093 INFO L226 Difference]: Without dead ends: 1813 [2025-03-08 07:54:11,096 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-03-08 07:54:11,097 INFO L435 NwaCegarLoop]: 2245 mSDtfsCounter, 3 mSDsluCounter, 4477 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:11,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6722 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:54:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-03-08 07:54:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1809. [2025-03-08 07:54:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4972345132743363) internal successors, (2707), 1808 states have internal predecessors, (2707), 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-03-08 07:54:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2707 transitions. [2025-03-08 07:54:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2707 transitions. Word has length 110 [2025-03-08 07:54:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:11,132 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2707 transitions. [2025-03-08 07:54:11,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-03-08 07:54:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2707 transitions. [2025-03-08 07:54:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:54:11,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:11,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:11,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:54:11,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:11,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash -807026498, now seen corresponding path program 1 times [2025-03-08 07:54:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:11,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454645272] [2025-03-08 07:54:11,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:11,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:54:11,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:54:11,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:54:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454645272] [2025-03-08 07:54:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454645272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:54:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29982336] [2025-03-08 07:54:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:54:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:54:11,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:54:11,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:54:11,413 INFO L87 Difference]: Start difference. First operand 1809 states and 2707 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-03-08 07:54:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:13,652 INFO L93 Difference]: Finished difference Result 5183 states and 7757 transitions. [2025-03-08 07:54:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:54:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 111 [2025-03-08 07:54:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:13,663 INFO L225 Difference]: With dead ends: 5183 [2025-03-08 07:54:13,664 INFO L226 Difference]: Without dead ends: 3488 [2025-03-08 07:54:13,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:54:13,668 INFO L435 NwaCegarLoop]: 1758 mSDtfsCounter, 2579 mSDsluCounter, 5159 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 6917 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:13,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 6917 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 07:54:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-03-08 07:54:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 1888. [2025-03-08 07:54:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.4965553789083201) internal successors, (2824), 1887 states have internal predecessors, (2824), 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-03-08 07:54:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2824 transitions. [2025-03-08 07:54:13,711 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2824 transitions. Word has length 111 [2025-03-08 07:54:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:13,712 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2824 transitions. [2025-03-08 07:54:13,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-03-08 07:54:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2824 transitions. [2025-03-08 07:54:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 07:54:13,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:13,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:13,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:54:13,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:13,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1054495841, now seen corresponding path program 1 times [2025-03-08 07:54:13,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:13,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460865517] [2025-03-08 07:54:13,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:13,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:13,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 07:54:13,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 07:54:13,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:13,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:54:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460865517] [2025-03-08 07:54:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460865517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:54:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936711304] [2025-03-08 07:54:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:54:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:54:13,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:54:13,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:54:13,966 INFO L87 Difference]: Start difference. First operand 1888 states and 2824 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-03-08 07:54:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:15,292 INFO L93 Difference]: Finished difference Result 3583 states and 5361 transitions. [2025-03-08 07:54:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:54:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 112 [2025-03-08 07:54:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:15,298 INFO L225 Difference]: With dead ends: 3583 [2025-03-08 07:54:15,298 INFO L226 Difference]: Without dead ends: 1888 [2025-03-08 07:54:15,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-08 07:54:15,301 INFO L435 NwaCegarLoop]: 1750 mSDtfsCounter, 2591 mSDsluCounter, 3491 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 5241 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:15,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2591 Valid, 5241 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 07:54:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-03-08 07:54:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1888. [2025-03-08 07:54:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.494435612082671) internal successors, (2820), 1887 states have internal predecessors, (2820), 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-03-08 07:54:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2820 transitions. [2025-03-08 07:54:15,329 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2820 transitions. Word has length 112 [2025-03-08 07:54:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:15,330 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2820 transitions. [2025-03-08 07:54:15,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-03-08 07:54:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2820 transitions. [2025-03-08 07:54:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 07:54:15,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:15,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:54:15,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 658708660, now seen corresponding path program 1 times [2025-03-08 07:54:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:54:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621871017] [2025-03-08 07:54:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:54:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 07:54:15,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 07:54:15,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:15,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:54:15,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 07:54:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 07:54:15,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 07:54:15,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:15,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:54:15,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 07:54:15,496 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 07:54:15,497 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 07:54:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:54:15,502 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:15,560 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 07:54:15,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 07:54:15,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:54:15 BoogieIcfgContainer [2025-03-08 07:54:15,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 07:54:15,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 07:54:15,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 07:54:15,595 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 07:54:15,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:54:05" (3/4) ... [2025-03-08 07:54:15,598 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 07:54:15,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 07:54:15,599 INFO L158 Benchmark]: Toolchain (without parser) took 16180.59ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 130.9MB in the beginning and 260.8MB in the end (delta: -129.9MB). Peak memory consumption was 211.3MB. Max. memory is 16.1GB. [2025-03-08 07:54:15,599 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:54:15,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.93ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 62.8MB in the end (delta: 68.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 07:54:15,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 417.68ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 62.3MB in the beginning and 66.5MB in the end (delta: -4.2MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2025-03-08 07:54:15,600 INFO L158 Benchmark]: Boogie Preprocessor took 518.13ms. Allocated memory was 176.2MB in the beginning and 453.0MB in the end (delta: 276.8MB). Free memory was 66.5MB in the beginning and 309.9MB in the end (delta: -243.4MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2025-03-08 07:54:15,600 INFO L158 Benchmark]: IcfgBuilder took 4709.33ms. Allocated memory is still 453.0MB. Free memory was 309.9MB in the beginning and 72.7MB in the end (delta: 237.2MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. [2025-03-08 07:54:15,600 INFO L158 Benchmark]: TraceAbstraction took 9912.57ms. Allocated memory was 453.0MB in the beginning and 503.3MB in the end (delta: 50.3MB). Free memory was 72.7MB in the beginning and 260.9MB in the end (delta: -188.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:54:15,600 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 503.3MB. Free memory was 260.9MB in the beginning and 260.8MB in the end (delta: 41.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:54:15,601 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.45ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.93ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 62.8MB in the end (delta: 68.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 417.68ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 62.3MB in the beginning and 66.5MB in the end (delta: -4.2MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 518.13ms. Allocated memory was 176.2MB in the beginning and 453.0MB in the end (delta: 276.8MB). Free memory was 66.5MB in the beginning and 309.9MB in the end (delta: -243.4MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * IcfgBuilder took 4709.33ms. Allocated memory is still 453.0MB. Free memory was 309.9MB in the beginning and 72.7MB in the end (delta: 237.2MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9912.57ms. Allocated memory was 453.0MB in the beginning and 503.3MB in the end (delta: 50.3MB). Free memory was 72.7MB in the beginning and 260.9MB in the end (delta: -188.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 503.3MB. Free memory was 260.9MB in the beginning and 260.8MB in the end (delta: 41.9kB). 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 bitwiseAnd at line 229, overapproximation of bitwiseAnd at line 231. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_2 var_76 = 1; [L44] const SORT_3 var_91 = 0; [L45] const SORT_4 var_227 = 3; [L46] const SORT_2 var_239 = 3; [L47] const SORT_4 var_241 = 6; [L48] const SORT_4 var_343 = 2; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_80; [L53] SORT_1 input_81; [L54] SORT_1 input_85; [L55] SORT_1 input_86; [L56] SORT_1 input_90; [L57] SORT_1 input_98; [L58] SORT_1 input_105; [L59] SORT_1 input_112; [L60] SORT_1 input_116; [L61] SORT_1 input_117; [L62] SORT_1 input_131; [L63] SORT_1 input_135; [L64] SORT_1 input_136; [L65] SORT_1 input_150; [L66] SORT_1 input_154; [L67] SORT_1 input_155; [L68] SORT_1 input_176; [L69] SORT_1 input_179; [L70] SORT_1 input_195; [L71] SORT_1 input_198; [L72] SORT_1 input_214; [L73] SORT_1 input_217; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L75] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L76] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L77] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L78] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L79] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L80] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L81] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L82] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L83] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L84] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L85] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L86] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L87] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L88] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L89] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L90] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L91] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L92] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L93] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L94] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L95] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L96] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L97] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L98] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L99] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L100] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L101] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L102] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] SORT_2 init_7_arg_1 = var_5; [L105] state_6 = init_7_arg_1 [L106] SORT_2 init_9_arg_1 = var_5; [L107] state_8 = init_9_arg_1 [L108] SORT_2 init_11_arg_1 = var_5; [L109] state_10 = init_11_arg_1 [L110] SORT_2 init_13_arg_1 = var_5; [L111] state_12 = init_13_arg_1 [L112] SORT_2 init_15_arg_1 = var_5; [L113] state_14 = init_15_arg_1 [L114] SORT_2 init_17_arg_1 = var_5; [L115] state_16 = init_17_arg_1 [L116] SORT_2 init_19_arg_1 = var_5; [L117] state_18 = init_19_arg_1 [L118] SORT_2 init_21_arg_1 = var_5; [L119] state_20 = init_21_arg_1 [L120] SORT_2 init_23_arg_1 = var_5; [L121] state_22 = init_23_arg_1 [L122] SORT_2 init_25_arg_1 = var_5; [L123] state_24 = init_25_arg_1 [L124] SORT_2 init_27_arg_1 = var_5; [L125] state_26 = init_27_arg_1 [L126] SORT_2 init_29_arg_1 = var_5; [L127] state_28 = init_29_arg_1 [L128] SORT_1 init_32_arg_1 = var_30; [L129] state_31 = init_32_arg_1 [L130] SORT_1 init_34_arg_1 = var_30; [L131] state_33 = init_34_arg_1 [L132] SORT_1 init_36_arg_1 = var_30; [L133] state_35 = init_36_arg_1 [L134] SORT_1 init_38_arg_1 = var_30; [L135] state_37 = init_38_arg_1 [L136] SORT_1 init_40_arg_1 = var_30; [L137] state_39 = init_40_arg_1 [L138] SORT_1 init_42_arg_1 = var_30; [L139] state_41 = init_42_arg_1 [L140] SORT_1 init_44_arg_1 = var_30; [L141] state_43 = init_44_arg_1 [L142] SORT_1 init_46_arg_1 = var_30; [L143] state_45 = init_46_arg_1 [L144] SORT_1 init_48_arg_1 = var_30; [L145] state_47 = init_48_arg_1 [L146] SORT_1 init_50_arg_1 = var_30; [L147] state_49 = init_50_arg_1 [L148] SORT_1 init_52_arg_1 = var_30; [L149] state_51 = init_52_arg_1 [L150] SORT_1 init_54_arg_1 = var_30; [L151] state_53 = init_54_arg_1 [L152] SORT_1 init_56_arg_1 = var_30; [L153] state_55 = init_56_arg_1 [L154] SORT_1 init_58_arg_1 = var_30; [L155] state_57 = init_58_arg_1 [L156] SORT_1 init_60_arg_1 = var_30; [L157] state_59 = init_60_arg_1 [L158] SORT_1 init_62_arg_1 = var_30; [L159] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L162] input_73 = __VERIFIER_nondet_uchar() [L163] EXPR input_73 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L163] input_73 = input_73 & mask_SORT_1 [L164] input_75 = __VERIFIER_nondet_uchar() [L165] EXPR input_75 & mask_SORT_1 VAL [input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L165] input_75 = input_75 & mask_SORT_1 [L166] input_80 = __VERIFIER_nondet_uchar() [L167] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L167] input_80 = input_80 & mask_SORT_1 [L168] input_81 = __VERIFIER_nondet_uchar() [L169] EXPR input_81 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L169] input_81 = input_81 & mask_SORT_1 [L170] input_85 = __VERIFIER_nondet_uchar() [L171] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L171] input_85 = input_85 & mask_SORT_1 [L172] input_86 = __VERIFIER_nondet_uchar() [L173] EXPR input_86 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L173] input_86 = input_86 & mask_SORT_1 [L174] input_90 = __VERIFIER_nondet_uchar() [L175] EXPR input_90 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L175] input_90 = input_90 & mask_SORT_1 [L176] input_98 = __VERIFIER_nondet_uchar() [L177] EXPR input_98 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L177] input_98 = input_98 & mask_SORT_1 [L178] input_105 = __VERIFIER_nondet_uchar() [L179] EXPR input_105 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L179] input_105 = input_105 & mask_SORT_1 [L180] input_112 = __VERIFIER_nondet_uchar() [L181] EXPR input_112 & mask_SORT_1 VAL [input_105=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L181] input_112 = input_112 & mask_SORT_1 [L182] input_116 = __VERIFIER_nondet_uchar() [L183] EXPR input_116 & mask_SORT_1 VAL [input_105=0, input_112=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L183] input_116 = input_116 & mask_SORT_1 [L184] input_117 = __VERIFIER_nondet_uchar() [L185] EXPR input_117 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L185] input_117 = input_117 & mask_SORT_1 [L186] input_131 = __VERIFIER_nondet_uchar() [L187] EXPR input_131 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L187] input_131 = input_131 & mask_SORT_1 [L188] input_135 = __VERIFIER_nondet_uchar() [L189] EXPR input_135 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L189] input_135 = input_135 & mask_SORT_1 [L190] input_136 = __VERIFIER_nondet_uchar() [L191] EXPR input_136 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L191] input_136 = input_136 & mask_SORT_1 [L192] input_150 = __VERIFIER_nondet_uchar() [L193] EXPR input_150 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L193] input_150 = input_150 & mask_SORT_1 [L194] input_154 = __VERIFIER_nondet_uchar() [L195] EXPR input_154 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L195] input_154 = input_154 & mask_SORT_1 [L196] input_155 = __VERIFIER_nondet_uchar() [L197] EXPR input_155 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L197] input_155 = input_155 & mask_SORT_1 [L198] input_176 = __VERIFIER_nondet_uchar() [L199] input_179 = __VERIFIER_nondet_uchar() [L200] input_195 = __VERIFIER_nondet_uchar() [L201] input_198 = __VERIFIER_nondet_uchar() [L202] input_214 = __VERIFIER_nondet_uchar() [L203] input_217 = __VERIFIER_nondet_uchar() [L206] SORT_1 var_65_arg_0 = state_39; [L207] SORT_4 var_65_arg_1 = var_63; [L208] SORT_4 var_65_arg_2 = var_64; [L209] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L210] SORT_1 var_66_arg_0 = state_49; [L211] SORT_4 var_66_arg_1 = var_63; [L212] SORT_4 var_66_arg_2 = var_64; [L213] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L214] SORT_4 var_67_arg_0 = var_65; [L215] SORT_4 var_67_arg_1 = var_66; [L216] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L217] SORT_1 var_68_arg_0 = state_59; [L218] SORT_4 var_68_arg_1 = var_63; [L219] SORT_4 var_68_arg_2 = var_64; [L220] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L221] SORT_4 var_69_arg_0 = var_67; [L222] SORT_4 var_69_arg_1 = var_68; [L223] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_69=0, var_74=0, var_76=1, var_91=0] [L224] EXPR var_69 & mask_SORT_4 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L224] var_69 = var_69 & mask_SORT_4 [L225] SORT_4 var_70_arg_0 = var_69; [L226] SORT_4 var_70_arg_1 = var_63; [L227] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L228] SORT_1 var_71_arg_0 = ~state_61; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_76=1, var_91=0] [L229] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_74=0, var_76=1, var_91=0] [L229] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L230] SORT_1 var_71_arg_1 = ~var_70; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_76=1, var_91=0] [L231] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_76=1, var_91=0] [L231] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L232] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L232] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L233] EXPR var_71 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L233] var_71 = var_71 & mask_SORT_1 [L234] SORT_1 bad_72_arg_0 = var_71; [L235] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1802 locations, 2699 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5173 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5173 mSDsluCounter, 39059 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26571 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11959 IncrementalHoareTripleChecker+Invalid, 11961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 12488 mSDtfsCounter, 11959 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1888occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1604 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 651 ConstructedInterpolants, 0 QuantifiedInterpolants, 1502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-03-08 07:54:15,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:54:17,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:54:17,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 07:54:17,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:54:17,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:54:17,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:54:17,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:54:17,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:54:17,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:54:17,688 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:54:17,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:54:17,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:54:17,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:54:17,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:54:17,688 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:54:17,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:54:17,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:54:17,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:54:17,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:54:17,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:54:17,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:54:17,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:54:17,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:54:17,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:54:17,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:54:17,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:54:17,691 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/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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2025-03-08 07:54:17,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:54:17,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:54:17,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:54:17,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:54:17,967 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:54:17,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-08 07:54:19,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5adfd2e/2142cd5f5699403fa3c85e15db38215e/FLAG519b046f4 [2025-03-08 07:54:19,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:54:19,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-08 07:54:19,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5adfd2e/2142cd5f5699403fa3c85e15db38215e/FLAG519b046f4 [2025-03-08 07:54:19,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5adfd2e/2142cd5f5699403fa3c85e15db38215e [2025-03-08 07:54:19,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:54:19,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:54:19,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:54:19,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:54:19,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:54:19,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:54:19" (1/1) ... [2025-03-08 07:54:19,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417c7b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:19, skipping insertion in model container [2025-03-08 07:54:19,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:54:19" (1/1) ... [2025-03-08 07:54:19,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:54:19,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-08 07:54:19,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:54:19,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:54:19,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-08 07:54:20,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:54:20,031 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:54:20,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20 WrapperNode [2025-03-08 07:54:20,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:54:20,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:54:20,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:54:20,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:54:20,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,157 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1649 [2025-03-08 07:54:20,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:54:20,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:54:20,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:54:20,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:54:20,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,210 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-03-08 07:54:20,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:54:20,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:54:20,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:54:20,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:54:20,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (1/1) ... [2025-03-08 07:54:20,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:54:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:20,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:54:20,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:54:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:54:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 07:54:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:54:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:54:20,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:54:20,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:54:21,826 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-08 07:54:21,826 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:54:21,833 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:54:21,834 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:54:21,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:54:21 BoogieIcfgContainer [2025-03-08 07:54:21,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:54:21,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:54:21,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:54:21,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:54:21,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:54:19" (1/3) ... [2025-03-08 07:54:21,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b024359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:54:21, skipping insertion in model container [2025-03-08 07:54:21,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:20" (2/3) ... [2025-03-08 07:54:21,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b024359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:54:21, skipping insertion in model container [2025-03-08 07:54:21,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:54:21" (3/3) ... [2025-03-08 07:54:21,844 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-08 07:54:21,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:54:21,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 07:54:21,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:54:21,904 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;@4232d116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:54:21,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:54:21,907 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-03-08 07:54:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 07:54:21,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:21,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 07:54:21,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:21,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 07:54:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:54:21,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005988948] [2025-03-08 07:54:21,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:54:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:21,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:54:21,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:54:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 07:54:22,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 07:54:22,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:22,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:22,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 07:54:22,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:54:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:54:22,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:54:22,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:54:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005988948] [2025-03-08 07:54:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005988948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:22,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:22,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:54:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015886765] [2025-03-08 07:54:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:22,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:54:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:54:22,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:54:22,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:54:22,574 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-03-08 07:54:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:22,733 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 07:54:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:54:22,737 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-03-08 07:54:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:22,741 INFO L225 Difference]: With dead ends: 18 [2025-03-08 07:54:22,742 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 07:54:22,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:54:22,746 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:22,747 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.1s Time] [2025-03-08 07:54:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 07:54:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 07:54:22,763 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-03-08 07:54:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 07:54:22,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 07:54:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:22,768 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 07:54:22,768 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-03-08 07:54:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 07:54:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 07:54:22,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:22,769 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:22,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:54:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:54:22,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 07:54:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:54:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095061422] [2025-03-08 07:54:22,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:54:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:22,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:54:22,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:54:23,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 07:54:23,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 07:54:23,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:23,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:23,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 07:54:23,400 INFO L279 TraceCheckSpWp]: Computing forward predicates...