./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.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.2.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 fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:53:45,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:53:45,712 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:45,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:53:45,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:53:45,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:53:45,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:53:45,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:53:45,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:53:45,740 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:53:45,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:53:45,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:53:45,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:53:45,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:53:45,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:53:45,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:53:45,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:53:45,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:53:45,743 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 -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2025-03-08 07:53:45,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:53:45,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:53:45,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:53:45,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:53:45,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:53:45,983 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.2.prop1-func-interl.c [2025-03-08 07:53:47,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb432675/739fc9a3cbd3472e9ced620c603268cf/FLAGcfbce646f [2025-03-08 07:53:47,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:53:47,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-08 07:53:47,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb432675/739fc9a3cbd3472e9ced620c603268cf/FLAGcfbce646f [2025-03-08 07:53:47,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb432675/739fc9a3cbd3472e9ced620c603268cf [2025-03-08 07:53:47,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:53:47,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:53:47,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:53:47,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:53:47,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:53:47,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:53:47" (1/1) ... [2025-03-08 07:53:47,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105070a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:47, skipping insertion in model container [2025-03-08 07:53:47,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:53:47" (1/1) ... [2025-03-08 07:53:47,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:53:47,942 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.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:53:48,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:53:48,140 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:53:48,147 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.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:53:48,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:53:48,253 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:53:48,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48 WrapperNode [2025-03-08 07:53:48,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:53:48,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:53:48,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:53:48,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:53:48,260 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:53:48" (1/1) ... [2025-03-08 07:53:48,292 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:53:48" (1/1) ... [2025-03-08 07:53:48,568 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3501 [2025-03-08 07:53:48,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:53:48,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:53:48,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:53:48,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:53:48,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,748 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:53:48,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:53:48,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:53:48,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:53:48,967 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:53:48,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (1/1) ... [2025-03-08 07:53:48,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:53:48,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:53:49,006 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:53:49,008 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:53:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:53:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:53:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:53:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:53:49,210 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:53:49,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:53:52,102 INFO L? ?]: Removed 1945 outVars from TransFormulas that were not future-live. [2025-03-08 07:53:52,102 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:53:52,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:53:52,225 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:53:52,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:53:52 BoogieIcfgContainer [2025-03-08 07:53:52,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:53:52,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:53:52,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:53:52,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:53:52,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:53:47" (1/3) ... [2025-03-08 07:53:52,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:53:52, skipping insertion in model container [2025-03-08 07:53:52,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:53:48" (2/3) ... [2025-03-08 07:53:52,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:53:52, skipping insertion in model container [2025-03-08 07:53:52,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:53:52" (3/3) ... [2025-03-08 07:53:52,233 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-08 07:53:52,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:53:52,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c that has 1 procedures, 1214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 07:53:52,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:53:52,324 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;@3802084e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:53:52,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:53:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 1214 states, 1212 states have (on average 1.4991749174917492) internal successors, (1817), 1213 states have internal predecessors, (1817), 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:53:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:53:52,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:52,338 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] [2025-03-08 07:53:52,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:52,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1595417857, now seen corresponding path program 1 times [2025-03-08 07:53:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:52,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907091443] [2025-03-08 07:53:52,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:52,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:53:52,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:53:52,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:52,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:53:52,941 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:53:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:53:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907091443] [2025-03-08 07:53:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907091443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:53:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:53:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:53:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181070917] [2025-03-08 07:53:52,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:53:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:53:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:53:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:53:52,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:53:52,966 INFO L87 Difference]: Start difference. First operand has 1214 states, 1212 states have (on average 1.4991749174917492) internal successors, (1817), 1213 states have internal predecessors, (1817), 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 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:53:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:53:53,556 INFO L93 Difference]: Finished difference Result 2349 states and 3519 transitions. [2025-03-08 07:53:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:53:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2025-03-08 07:53:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:53:53,572 INFO L225 Difference]: With dead ends: 2349 [2025-03-08 07:53:53,574 INFO L226 Difference]: Without dead ends: 1213 [2025-03-08 07:53:53,580 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:53:53,582 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:53:53,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4525 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:53:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-08 07:53:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2025-03-08 07:53:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.4975247524752475) internal successors, (1815), 1212 states have internal predecessors, (1815), 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:53:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1815 transitions. [2025-03-08 07:53:53,663 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1815 transitions. Word has length 77 [2025-03-08 07:53:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:53:53,664 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1815 transitions. [2025-03-08 07:53:53,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:53:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1815 transitions. [2025-03-08 07:53:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:53:53,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:53,666 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] [2025-03-08 07:53:53,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:53:53,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:53,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:53,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2086334985, now seen corresponding path program 1 times [2025-03-08 07:53:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:53,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933155444] [2025-03-08 07:53:53,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:53,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:53:53,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:53:53,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:53,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:53:53,901 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:53:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:53:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933155444] [2025-03-08 07:53:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933155444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:53:53,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:53:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:53:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899557935] [2025-03-08 07:53:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:53:53,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:53:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:53:53,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:53:53,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:53:53,903 INFO L87 Difference]: Start difference. First operand 1213 states and 1815 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:53:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:53:54,389 INFO L93 Difference]: Finished difference Result 2350 states and 3517 transitions. [2025-03-08 07:53:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:53:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-03-08 07:53:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:53:54,394 INFO L225 Difference]: With dead ends: 2350 [2025-03-08 07:53:54,394 INFO L226 Difference]: Without dead ends: 1215 [2025-03-08 07:53:54,399 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:53:54,399 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:53:54,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4522 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:53:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-08 07:53:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-03-08 07:53:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.4967051070840198) internal successors, (1817), 1214 states have internal predecessors, (1817), 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:53:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1817 transitions. [2025-03-08 07:53:54,429 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1817 transitions. Word has length 78 [2025-03-08 07:53:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:53:54,429 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1817 transitions. [2025-03-08 07:53:54,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:53:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1817 transitions. [2025-03-08 07:53:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:53:54,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:54,431 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] [2025-03-08 07:53:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:53:54,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2111581126, now seen corresponding path program 1 times [2025-03-08 07:53:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129076656] [2025-03-08 07:53:54,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:54,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:53:54,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:53:54,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:54,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:53:54,657 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:53:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:53:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129076656] [2025-03-08 07:53:54,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129076656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:53:54,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:53:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:53:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935883110] [2025-03-08 07:53:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:53:54,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:53:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:53:54,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:53:54,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:53:54,659 INFO L87 Difference]: Start difference. First operand 1215 states and 1817 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:53:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:53:55,141 INFO L93 Difference]: Finished difference Result 2354 states and 3521 transitions. [2025-03-08 07:53:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:53:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-08 07:53:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:53:55,146 INFO L225 Difference]: With dead ends: 2354 [2025-03-08 07:53:55,146 INFO L226 Difference]: Without dead ends: 1217 [2025-03-08 07:53:55,147 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:53:55,148 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:53:55,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4517 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:53:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-08 07:53:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2025-03-08 07:53:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.495888157894737) internal successors, (1819), 1216 states have internal predecessors, (1819), 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:53:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1819 transitions. [2025-03-08 07:53:55,176 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1819 transitions. Word has length 79 [2025-03-08 07:53:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:53:55,178 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1819 transitions. [2025-03-08 07:53:55,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:53:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1819 transitions. [2025-03-08 07:53:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:53:55,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:55,182 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] [2025-03-08 07:53:55,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:53:55,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash 853858894, now seen corresponding path program 1 times [2025-03-08 07:53:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312312977] [2025-03-08 07:53:55,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:55,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:53:55,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:53:55,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:53:55,402 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:53:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:53:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312312977] [2025-03-08 07:53:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312312977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:53:55,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:53:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:53:55,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039132134] [2025-03-08 07:53:55,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:53:55,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:53:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:53:55,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:53:55,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:53:55,405 INFO L87 Difference]: Start difference. First operand 1217 states and 1819 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:53:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:53:55,859 INFO L93 Difference]: Finished difference Result 2364 states and 3533 transitions. [2025-03-08 07:53:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:53:55,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-03-08 07:53:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:53:55,865 INFO L225 Difference]: With dead ends: 2364 [2025-03-08 07:53:55,865 INFO L226 Difference]: Without dead ends: 1225 [2025-03-08 07:53:55,867 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:53:55,869 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 3 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:53:55,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4517 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:53:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-08 07:53:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1221. [2025-03-08 07:53:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 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:53:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1825 transitions. [2025-03-08 07:53:55,893 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1825 transitions. Word has length 80 [2025-03-08 07:53:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:53:55,894 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1825 transitions. [2025-03-08 07:53:55,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:53:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1825 transitions. [2025-03-08 07:53:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:53:55,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:55,896 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] [2025-03-08 07:53:55,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:53:55,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:55,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:55,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1399621237, now seen corresponding path program 1 times [2025-03-08 07:53:55,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:55,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984855144] [2025-03-08 07:53:55,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:55,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:53:55,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:53:55,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:55,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:53:56,137 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:53:56,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:53:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984855144] [2025-03-08 07:53:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984855144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:53:56,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:53:56,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:53:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980045790] [2025-03-08 07:53:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:53:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:53:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:53:56,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:53:56,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:53:56,140 INFO L87 Difference]: Start difference. First operand 1221 states and 1825 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:53:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:53:57,675 INFO L93 Difference]: Finished difference Result 3491 states and 5219 transitions. [2025-03-08 07:53:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:53:57,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2025-03-08 07:53:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:53:57,683 INFO L225 Difference]: With dead ends: 3491 [2025-03-08 07:53:57,683 INFO L226 Difference]: Without dead ends: 2348 [2025-03-08 07:53:57,685 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:53:57,687 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 1727 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:53:57,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 4626 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 07:53:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-08 07:53:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1276. [2025-03-08 07:53:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.4949019607843137) internal successors, (1906), 1275 states have internal predecessors, (1906), 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:53:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1906 transitions. [2025-03-08 07:53:57,713 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1906 transitions. Word has length 81 [2025-03-08 07:53:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:53:57,713 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1906 transitions. [2025-03-08 07:53:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:53:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1906 transitions. [2025-03-08 07:53:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:53:57,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:57,714 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] [2025-03-08 07:53:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:53:57,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash 639582190, now seen corresponding path program 1 times [2025-03-08 07:53:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034688615] [2025-03-08 07:53:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:57,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:53:57,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:53:57,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:57,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:53:58,017 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:53:58,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:53:58,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034688615] [2025-03-08 07:53:58,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034688615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:53:58,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:53:58,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:53:58,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307738213] [2025-03-08 07:53:58,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:53:58,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:53:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:53:58,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:53:58,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:53:58,021 INFO L87 Difference]: Start difference. First operand 1276 states and 1906 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:53:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:53:59,261 INFO L93 Difference]: Finished difference Result 2434 states and 3636 transitions. [2025-03-08 07:53:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:53:59,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2025-03-08 07:53:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:53:59,265 INFO L225 Difference]: With dead ends: 2434 [2025-03-08 07:53:59,265 INFO L226 Difference]: Without dead ends: 1291 [2025-03-08 07:53:59,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:53:59,268 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 1760 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:53:59,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 4644 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 07:53:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-08 07:53:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2025-03-08 07:53:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1288 states have (on average 1.4914596273291925) internal successors, (1921), 1288 states have internal predecessors, (1921), 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:53:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1921 transitions. [2025-03-08 07:53:59,332 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1921 transitions. Word has length 82 [2025-03-08 07:53:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:53:59,332 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1921 transitions. [2025-03-08 07:53:59,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:53:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1921 transitions. [2025-03-08 07:53:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 07:53:59,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:53:59,334 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] [2025-03-08 07:53:59,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:53:59,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:53:59,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:53:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1922412680, now seen corresponding path program 1 times [2025-03-08 07:53:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:53:59,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670157279] [2025-03-08 07:53:59,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:53:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:53:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 07:53:59,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 07:53:59,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:59,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:53:59,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 07:53:59,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 07:53:59,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 07:53:59,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:53:59,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:53:59,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 07:53:59,448 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 07:53:59,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 07:53:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:53:59,452 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:53:59,500 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 07:53:59,516 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 07:53:59,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:53:59 BoogieIcfgContainer [2025-03-08 07:53:59,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 07:53:59,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 07:53:59,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 07:53:59,520 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 07:53:59,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:53:52" (3/4) ... [2025-03-08 07:53:59,522 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 07:53:59,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 07:53:59,524 INFO L158 Benchmark]: Toolchain (without parser) took 11736.91ms. Allocated memory was 142.6MB in the beginning and 897.6MB in the end (delta: 755.0MB). Free memory was 112.0MB in the beginning and 730.9MB in the end (delta: -618.9MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2025-03-08 07:53:59,524 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:53:59,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.62ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 63.5MB in the end (delta: 48.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 07:53:59,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 313.63ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 63.5MB in the beginning and 305.4MB in the end (delta: -241.9MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2025-03-08 07:53:59,525 INFO L158 Benchmark]: Boogie Preprocessor took 396.74ms. Allocated memory is still 394.3MB. Free memory was 305.4MB in the beginning and 293.2MB in the end (delta: 12.1MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-03-08 07:53:59,526 INFO L158 Benchmark]: IcfgBuilder took 3258.92ms. Allocated memory was 394.3MB in the beginning and 897.6MB in the end (delta: 503.3MB). Free memory was 293.2MB in the beginning and 722.1MB in the end (delta: -428.9MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. [2025-03-08 07:53:59,526 INFO L158 Benchmark]: TraceAbstraction took 7292.06ms. Allocated memory is still 897.6MB. Free memory was 722.1MB in the beginning and 730.9MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:53:59,526 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 897.6MB. Free memory was 730.9MB in the beginning and 730.9MB in the end (delta: 76.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:53:59,527 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.46ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.62ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 63.5MB in the end (delta: 48.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 313.63ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 63.5MB in the beginning and 305.4MB in the end (delta: -241.9MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 396.74ms. Allocated memory is still 394.3MB. Free memory was 305.4MB in the beginning and 293.2MB in the end (delta: 12.1MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * IcfgBuilder took 3258.92ms. Allocated memory was 394.3MB in the beginning and 897.6MB in the end (delta: 503.3MB). Free memory was 293.2MB in the beginning and 722.1MB in the end (delta: -428.9MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7292.06ms. Allocated memory is still 897.6MB. Free memory was 722.1MB in the beginning and 730.9MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 897.6MB. Free memory was 730.9MB in the beginning and 730.9MB in the end (delta: 76.2kB). 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 172, overapproximation of bitwiseAnd at line 174. 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_22 = 0; [L40] const SORT_4 var_45 = 1; [L41] const SORT_4 var_46 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 1; [L44] const SORT_3 var_66 = 0; [L45] const SORT_4 var_153 = 2; [L46] const SORT_2 var_165 = 2; [L47] const SORT_4 var_167 = 6; [L49] SORT_1 input_53; [L50] SORT_1 input_55; [L51] SORT_1 input_60; [L52] SORT_1 input_61; [L53] SORT_1 input_65; [L54] SORT_1 input_73; [L55] SORT_1 input_80; [L56] SORT_1 input_84; [L57] SORT_1 input_85; [L58] SORT_1 input_97; [L59] SORT_1 input_101; [L60] SORT_1 input_102; [L61] SORT_1 input_121; [L62] SORT_1 input_124; [L63] SORT_1 input_140; [L64] SORT_1 input_143; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L66] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L67] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L68] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L69] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L70] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L71] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L72] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L73] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L74] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L75] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L76] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L77] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L78] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L79] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L80] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L81] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L82] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L83] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L84] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] SORT_2 init_7_arg_1 = var_5; [L87] state_6 = init_7_arg_1 [L88] SORT_2 init_9_arg_1 = var_5; [L89] state_8 = init_9_arg_1 [L90] SORT_2 init_11_arg_1 = var_5; [L91] state_10 = init_11_arg_1 [L92] SORT_2 init_13_arg_1 = var_5; [L93] state_12 = init_13_arg_1 [L94] SORT_2 init_15_arg_1 = var_5; [L95] state_14 = init_15_arg_1 [L96] SORT_2 init_17_arg_1 = var_5; [L97] state_16 = init_17_arg_1 [L98] SORT_2 init_19_arg_1 = var_5; [L99] state_18 = init_19_arg_1 [L100] SORT_2 init_21_arg_1 = var_5; [L101] state_20 = init_21_arg_1 [L102] SORT_1 init_24_arg_1 = var_22; [L103] state_23 = init_24_arg_1 [L104] SORT_1 init_26_arg_1 = var_22; [L105] state_25 = init_26_arg_1 [L106] SORT_1 init_28_arg_1 = var_22; [L107] state_27 = init_28_arg_1 [L108] SORT_1 init_30_arg_1 = var_22; [L109] state_29 = init_30_arg_1 [L110] SORT_1 init_32_arg_1 = var_22; [L111] state_31 = init_32_arg_1 [L112] SORT_1 init_34_arg_1 = var_22; [L113] state_33 = init_34_arg_1 [L114] SORT_1 init_36_arg_1 = var_22; [L115] state_35 = init_36_arg_1 [L116] SORT_1 init_38_arg_1 = var_22; [L117] state_37 = init_38_arg_1 [L118] SORT_1 init_40_arg_1 = var_22; [L119] state_39 = init_40_arg_1 [L120] SORT_1 init_42_arg_1 = var_22; [L121] state_41 = init_42_arg_1 [L122] SORT_1 init_44_arg_1 = var_22; [L123] state_43 = init_44_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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L126] input_53 = __VERIFIER_nondet_uchar() [L127] EXPR input_53 & 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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L127] input_53 = input_53 & mask_SORT_1 [L128] input_55 = __VERIFIER_nondet_uchar() [L129] EXPR input_55 & mask_SORT_1 VAL [input_53=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L129] input_55 = input_55 & mask_SORT_1 [L130] input_60 = __VERIFIER_nondet_uchar() [L131] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L131] input_60 = input_60 & mask_SORT_1 [L132] input_61 = __VERIFIER_nondet_uchar() [L133] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L133] input_61 = input_61 & mask_SORT_1 [L134] input_65 = __VERIFIER_nondet_uchar() [L135] EXPR input_65 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L135] input_65 = input_65 & mask_SORT_1 [L136] input_73 = __VERIFIER_nondet_uchar() [L137] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L137] input_73 = input_73 & mask_SORT_1 [L138] input_80 = __VERIFIER_nondet_uchar() [L139] EXPR input_80 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, 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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L139] input_80 = input_80 & mask_SORT_1 [L140] input_84 = __VERIFIER_nondet_uchar() [L141] EXPR input_84 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L141] input_84 = input_84 & mask_SORT_1 [L142] input_85 = __VERIFIER_nondet_uchar() [L143] EXPR input_85 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L143] input_85 = input_85 & mask_SORT_1 [L144] input_97 = __VERIFIER_nondet_uchar() [L145] EXPR input_97 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L145] input_97 = input_97 & mask_SORT_1 [L146] input_101 = __VERIFIER_nondet_uchar() [L147] EXPR input_101 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L147] input_101 = input_101 & mask_SORT_1 [L148] input_102 = __VERIFIER_nondet_uchar() [L149] EXPR input_102 & mask_SORT_1 VAL [input_101=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L149] input_102 = input_102 & mask_SORT_1 [L150] input_121 = __VERIFIER_nondet_uchar() [L151] input_124 = __VERIFIER_nondet_uchar() [L152] input_140 = __VERIFIER_nondet_uchar() [L153] input_143 = __VERIFIER_nondet_uchar() [L156] SORT_1 var_47_arg_0 = state_31; [L157] SORT_4 var_47_arg_1 = var_45; [L158] SORT_4 var_47_arg_2 = var_46; [L159] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L160] SORT_1 var_48_arg_0 = state_41; [L161] SORT_4 var_48_arg_1 = var_45; [L162] SORT_4 var_48_arg_2 = var_46; [L163] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L164] SORT_4 var_49_arg_0 = var_47; [L165] SORT_4 var_49_arg_1 = var_48; [L166] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_49=0, var_54=0, var_56=1, var_66=0] [L167] EXPR var_49 & mask_SORT_4 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L167] var_49 = var_49 & mask_SORT_4 [L168] SORT_4 var_50_arg_0 = var_49; [L169] SORT_4 var_50_arg_1 = var_45; [L170] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L171] SORT_1 var_51_arg_0 = ~state_43; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=1, var_66=0] [L172] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_50=1, var_54=0, var_56=1, var_66=0] [L172] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L173] SORT_1 var_51_arg_1 = ~var_50; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=1, var_66=0] [L174] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_51_arg_0=1, var_54=0, var_56=1, var_66=0] [L174] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L175] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L175] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L176] EXPR var_51 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=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_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L176] var_51 = var_51 & mask_SORT_1 [L177] SORT_1 bad_52_arg_0 = var_51; [L178] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1214 locations, 1817 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3490 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3490 mSDsluCounter, 27351 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18968 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8789 IncrementalHoareTripleChecker+Invalid, 8791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8383 mSDtfsCounter, 8789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1289occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 1078 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 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:53:59,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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.2.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 fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:54:01,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:54:01,531 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:01,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:54:01,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:54:01,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:54:01,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:54:01,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:54:01,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:54:01,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:54:01,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:54:01,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:54:01,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:54:01,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:54:01,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:54:01,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:54:01,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:54:01,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:54:01,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:54:01,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:54:01,568 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 -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2025-03-08 07:54:01,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:54:01,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:54:01,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:54:01,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:54:01,788 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:54:01,791 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.2.prop1-func-interl.c [2025-03-08 07:54:02,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad81fdaa/e7330646f5314cc4ad0db360d48321cf/FLAG4c1cdec7a [2025-03-08 07:54:03,202 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:54:03,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-08 07:54:03,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad81fdaa/e7330646f5314cc4ad0db360d48321cf/FLAG4c1cdec7a [2025-03-08 07:54:03,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad81fdaa/e7330646f5314cc4ad0db360d48321cf [2025-03-08 07:54:03,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:54:03,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:54:03,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:54:03,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:54:03,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:54:03,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:54:03" (1/1) ... [2025-03-08 07:54:03,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:03, skipping insertion in model container [2025-03-08 07:54:03,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:54:03" (1/1) ... [2025-03-08 07:54:03,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:54:03,660 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.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:54:03,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:54:03,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:54:03,823 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.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:54:03,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:54:03,904 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:54:03,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:03 WrapperNode [2025-03-08 07:54:03,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:54:03,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:54:03,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:54:03,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:54:03,925 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:03" (1/1) ... [2025-03-08 07:54:03,948 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:03" (1/1) ... [2025-03-08 07:54:03,991 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1093 [2025-03-08 07:54:03,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:54:03,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:54:03,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:54:03,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:54:03,998 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:03" (1/1) ... [2025-03-08 07:54:03,998 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:03" (1/1) ... [2025-03-08 07:54:04,005 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:03" (1/1) ... [2025-03-08 07:54:04,035 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:04,035 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:03" (1/1) ... [2025-03-08 07:54:04,035 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:03" (1/1) ... [2025-03-08 07:54:04,050 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:03" (1/1) ... [2025-03-08 07:54:04,052 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:03" (1/1) ... [2025-03-08 07:54:04,059 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:03" (1/1) ... [2025-03-08 07:54:04,067 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:03" (1/1) ... [2025-03-08 07:54:04,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:54:04,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:54:04,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:54:04,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:54:04,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:03" (1/1) ... [2025-03-08 07:54:04,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:54:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:04,107 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:04,110 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:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:54:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 07:54:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:54:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:54:04,292 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:54:04,293 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:54:05,105 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-08 07:54:05,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:54:05,111 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:54:05,111 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:54:05,112 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,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:54:05,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:54:05,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:54:05,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:54:05,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:54:03" (1/3) ... [2025-03-08 07:54:05,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6fb658 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,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:54:03" (2/3) ... [2025-03-08 07:54:05,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6fb658 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,119 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,120 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-08 07:54:05,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:54:05,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.2.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:05,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:54:05,166 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;@41e0b2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:54:05,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:54:05,168 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:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 07:54:05,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:05,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 07:54:05,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 07:54:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:54:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428169706] [2025-03-08 07:54:05,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:05,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:54:05,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:05,189 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:05,190 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:05,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 07:54:05,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 07:54:05,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:05,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:05,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 07:54:05,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:54:05,564 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:05,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:54:05,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:54:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428169706] [2025-03-08 07:54:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428169706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:54:05,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:54:05,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:54:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372476890] [2025-03-08 07:54:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:54:05,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:54:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:54:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:54:05,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:54:05,584 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:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:54:05,662 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 07:54:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:54:05,667 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:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:54:05,670 INFO L225 Difference]: With dead ends: 18 [2025-03-08 07:54:05,671 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 07:54:05,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:54:05,674 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:54:05,675 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:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 07:54:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 07:54:05,691 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:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 07:54:05,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 07:54:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:54:05,694 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 07:54:05,694 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:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 07:54:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 07:54:05,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:54:05,694 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 07:54:05,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:54:05,895 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:05,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:54:05,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:54:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 07:54:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:54:05,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004833546] [2025-03-08 07:54:05,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:54:05,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:54:05,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:54:05,898 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:05,899 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:06,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 07:54:06,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 07:54:06,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:54:06,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:54:06,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 07:54:06,175 INFO L279 TraceCheckSpWp]: Computing forward predicates...