./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:16:10,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:16:10,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:16:10,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:16:10,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:16:10,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:16:10,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:16:10,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:16:10,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:16:10,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:16:10,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:16:10,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:16:10,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:16:10,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:16:10,794 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:16:10,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:16:10,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:16:10,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:16:10,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:16:10,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:16:10,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2025-02-07 22:16:11,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:16:11,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:16:11,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:16:11,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:16:11,029 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:16:11,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-02-07 22:16:12,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e11740f/209fc09d8ecc48bf9fd114f3e7a0fea5/FLAG0d8c38e63 [2025-02-07 22:16:12,474 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:16:12,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-02-07 22:16:12,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e11740f/209fc09d8ecc48bf9fd114f3e7a0fea5/FLAG0d8c38e63 [2025-02-07 22:16:12,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e11740f/209fc09d8ecc48bf9fd114f3e7a0fea5 [2025-02-07 22:16:12,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:16:12,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:16:12,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:16:12,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:16:12,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:16:12,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:16:12" (1/1) ... [2025-02-07 22:16:12,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1078fda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:12, skipping insertion in model container [2025-02-07 22:16:12,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:16:12" (1/1) ... [2025-02-07 22:16:12,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:16:12,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:16:13,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:16:13,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:16:13,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:16:13,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:16:13,289 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:16:13,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13 WrapperNode [2025-02-07 22:16:13,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:16:13,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:16:13,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:16:13,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:16:13,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,606 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3501 [2025-02-07 22:16:13,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:16:13,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:16:13,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:16:13,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:16:13,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,857 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-02-07 22:16:13,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:13,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:14,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:14,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:14,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:16:14,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:16:14,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:16:14,097 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:16:14,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (1/1) ... [2025-02-07 22:16:14,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:16:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:16:14,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:16:14,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:16:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:16:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:16:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:16:14,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:16:14,348 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:16:14,349 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:16:17,294 INFO L? ?]: Removed 1943 outVars from TransFormulas that were not future-live. [2025-02-07 22:16:17,295 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:16:17,495 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:16:17,495 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:16:17,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:16:17 BoogieIcfgContainer [2025-02-07 22:16:17,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:16:17,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:16:17,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:16:17,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:16:17,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:16:12" (1/3) ... [2025-02-07 22:16:17,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d527acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:16:17, skipping insertion in model container [2025-02-07 22:16:17,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:13" (2/3) ... [2025-02-07 22:16:17,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d527acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:16:17, skipping insertion in model container [2025-02-07 22:16:17,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:16:17" (3/3) ... [2025-02-07 22:16:17,510 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-02-07 22:16:17,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:16:17,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c that has 1 procedures, 1212 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:16:17,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:16:17,622 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d2dd70b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:16:17,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:16:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 1212 states, 1210 states have (on average 1.5) internal successors, (1815), 1211 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-02-07 22:16:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 22:16:17,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:17,635 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] [2025-02-07 22:16:17,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2018128484, now seen corresponding path program 1 times [2025-02-07 22:16:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150148194] [2025-02-07 22:16:17,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 22:16:17,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 22:16:17,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:17,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:18,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:16:18,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150148194] [2025-02-07 22:16:18,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150148194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:18,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:16:18,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997186597] [2025-02-07 22:16:18,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:18,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:16:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:16:18,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:16:18,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:16:18,338 INFO L87 Difference]: Start difference. First operand has 1212 states, 1210 states have (on average 1.5) internal successors, (1815), 1211 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) Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-07 22:16:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:18,946 INFO L93 Difference]: Finished difference Result 2347 states and 3517 transitions. [2025-02-07 22:16:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:16:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 76 [2025-02-07 22:16:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:18,958 INFO L225 Difference]: With dead ends: 2347 [2025-02-07 22:16:18,959 INFO L226 Difference]: Without dead ends: 1212 [2025-02-07 22:16:18,963 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-02-07 22:16:18,967 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 0 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4522 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-02-07 22:16:18,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4522 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:16:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2025-02-07 22:16:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2025-02-07 22:16:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.4979355904211396) internal successors, (1814), 1211 states have internal predecessors, (1814), 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-02-07 22:16:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1814 transitions. [2025-02-07 22:16:19,032 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1814 transitions. Word has length 76 [2025-02-07 22:16:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:19,032 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1814 transitions. [2025-02-07 22:16:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-07 22:16:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1814 transitions. [2025-02-07 22:16:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-07 22:16:19,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:19,035 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-02-07 22:16:19,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:16:19,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:19,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1867207434, now seen corresponding path program 1 times [2025-02-07 22:16:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931823780] [2025-02-07 22:16:19,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:19,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 22:16:19,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 22:16:19,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:19,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:19,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:16:19,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931823780] [2025-02-07 22:16:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931823780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:16:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114497182] [2025-02-07 22:16:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:19,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:16:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:16:19,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:16:19,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:16:19,221 INFO L87 Difference]: Start difference. First operand 1212 states and 1814 transitions. 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-02-07 22:16:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:19,720 INFO L93 Difference]: Finished difference Result 2349 states and 3516 transitions. [2025-02-07 22:16:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:16:19,721 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-02-07 22:16:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:19,725 INFO L225 Difference]: With dead ends: 2349 [2025-02-07 22:16:19,725 INFO L226 Difference]: Without dead ends: 1214 [2025-02-07 22:16:19,726 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-02-07 22:16:19,727 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 0 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4519 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.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:16:19,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4519 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:16:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-02-07 22:16:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2025-02-07 22:16:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4971145919208573) internal successors, (1816), 1213 states have internal predecessors, (1816), 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-02-07 22:16:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1816 transitions. [2025-02-07 22:16:19,748 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1816 transitions. Word has length 77 [2025-02-07 22:16:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:19,748 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1816 transitions. [2025-02-07 22:16:19,749 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-02-07 22:16:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1816 transitions. [2025-02-07 22:16:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 22:16:19,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:19,750 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-02-07 22:16:19,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:16:19,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:19,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -314600617, now seen corresponding path program 1 times [2025-02-07 22:16:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240040699] [2025-02-07 22:16:19,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:19,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 22:16:19,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 22:16:19,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:19,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:16:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240040699] [2025-02-07 22:16:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240040699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:20,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:16:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455371874] [2025-02-07 22:16:20,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:20,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:16:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:16:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:16:20,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:16:20,074 INFO L87 Difference]: Start difference. First operand 1214 states and 1816 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-02-07 22:16:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:20,574 INFO L93 Difference]: Finished difference Result 2353 states and 3520 transitions. [2025-02-07 22:16:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:16:20,575 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-02-07 22:16:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:20,580 INFO L225 Difference]: With dead ends: 2353 [2025-02-07 22:16:20,581 INFO L226 Difference]: Without dead ends: 1216 [2025-02-07 22:16:20,583 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-02-07 22:16:20,584 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 0 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4514 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.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:16:20,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4514 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:16:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-02-07 22:16:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2025-02-07 22:16:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.4962962962962962) internal successors, (1818), 1215 states have internal predecessors, (1818), 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-02-07 22:16:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1818 transitions. [2025-02-07 22:16:20,613 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1818 transitions. Word has length 78 [2025-02-07 22:16:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:20,613 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1818 transitions. [2025-02-07 22:16:20,613 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-02-07 22:16:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1818 transitions. [2025-02-07 22:16:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 22:16:20,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:20,614 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-02-07 22:16:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:16:20,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 725679823, now seen corresponding path program 1 times [2025-02-07 22:16:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830134531] [2025-02-07 22:16:20,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 22:16:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 22:16:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:16:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830134531] [2025-02-07 22:16:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830134531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:20,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:20,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:16:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275337293] [2025-02-07 22:16:20,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:16:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:16:20,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:16:20,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:16:20,772 INFO L87 Difference]: Start difference. First operand 1216 states and 1818 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-02-07 22:16:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:21,231 INFO L93 Difference]: Finished difference Result 2363 states and 3532 transitions. [2025-02-07 22:16:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:16:21,231 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-02-07 22:16:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:21,238 INFO L225 Difference]: With dead ends: 2363 [2025-02-07 22:16:21,238 INFO L226 Difference]: Without dead ends: 1224 [2025-02-07 22:16:21,239 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-02-07 22:16:21,242 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 3 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4514 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-02-07 22:16:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4514 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:16:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-02-07 22:16:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1220. [2025-02-07 22:16:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 1.4963084495488106) internal successors, (1824), 1219 states have internal predecessors, (1824), 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-02-07 22:16:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1824 transitions. [2025-02-07 22:16:21,264 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1824 transitions. Word has length 79 [2025-02-07 22:16:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:21,266 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1824 transitions. [2025-02-07 22:16:21,266 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-02-07 22:16:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1824 transitions. [2025-02-07 22:16:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 22:16:21,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:21,268 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-02-07 22:16:21,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:16:21,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1721037330, now seen corresponding path program 1 times [2025-02-07 22:16:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776203332] [2025-02-07 22:16:21,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:21,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 22:16:21,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 22:16:21,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:21,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:16:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776203332] [2025-02-07 22:16:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776203332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:16:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433539932] [2025-02-07 22:16:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:16:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:16:21,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:16:21,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:16:21,501 INFO L87 Difference]: Start difference. First operand 1220 states and 1824 transitions. Second operand has 5 states, 5 states have (on average 16.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-02-07 22:16:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:23,081 INFO L93 Difference]: Finished difference Result 3490 states and 5218 transitions. [2025-02-07 22:16:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:16:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.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-02-07 22:16:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:23,088 INFO L225 Difference]: With dead ends: 3490 [2025-02-07 22:16:23,089 INFO L226 Difference]: Without dead ends: 2347 [2025-02-07 22:16:23,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-07 22:16:23,091 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 1727 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 4622 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.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:16:23,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 4622 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 22:16:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2025-02-07 22:16:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1275. [2025-02-07 22:16:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.4952904238618525) internal successors, (1905), 1274 states have internal predecessors, (1905), 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-02-07 22:16:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1905 transitions. [2025-02-07 22:16:23,118 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1905 transitions. Word has length 80 [2025-02-07 22:16:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:23,118 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1905 transitions. [2025-02-07 22:16:23,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.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-02-07 22:16:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1905 transitions. [2025-02-07 22:16:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 22:16:23,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:23,119 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-02-07 22:16:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:16:23,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1988017810, now seen corresponding path program 1 times [2025-02-07 22:16:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583787742] [2025-02-07 22:16:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:23,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 22:16:23,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 22:16:23,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:23,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:23,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:16:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583787742] [2025-02-07 22:16:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583787742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:23,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:23,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:16:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135654935] [2025-02-07 22:16:23,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:23,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:16:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:16:23,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:16:23,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:16:23,368 INFO L87 Difference]: Start difference. First operand 1275 states and 1905 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-02-07 22:16:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:24,362 INFO L93 Difference]: Finished difference Result 2418 states and 3614 transitions. [2025-02-07 22:16:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:16:24,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-02-07 22:16:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:24,366 INFO L225 Difference]: With dead ends: 2418 [2025-02-07 22:16:24,366 INFO L226 Difference]: Without dead ends: 1275 [2025-02-07 22:16:24,367 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-02-07 22:16:24,368 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 1740 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 3500 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:16:24,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 3500 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:16:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-02-07 22:16:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2025-02-07 22:16:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.4921507064364208) internal successors, (1901), 1274 states have internal predecessors, (1901), 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-02-07 22:16:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1901 transitions. [2025-02-07 22:16:24,388 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1901 transitions. Word has length 81 [2025-02-07 22:16:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:24,389 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1901 transitions. [2025-02-07 22:16:24,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-02-07 22:16:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1901 transitions. [2025-02-07 22:16:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-07 22:16:24,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:24,389 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-02-07 22:16:24,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:16:24,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:24,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2027262489, now seen corresponding path program 1 times [2025-02-07 22:16:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:16:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868285139] [2025-02-07 22:16:24,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:16:24,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-07 22:16:24,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 22:16:24,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:24,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:16:24,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:16:24,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-07 22:16:24,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 22:16:24,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:24,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:16:24,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:16:24,520 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:16:24,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:16:24,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:16:24,524 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:16:24,571 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:16:24,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:16:24,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:16:24 BoogieIcfgContainer [2025-02-07 22:16:24,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:16:24,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:16:24,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:16:24,598 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:16:24,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:16:17" (3/4) ... [2025-02-07 22:16:24,600 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:16:24,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:16:24,602 INFO L158 Benchmark]: Toolchain (without parser) took 11838.31ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.1MB in the beginning and 133.9MB in the end (delta: -28.8MB). Peak memory consumption was 249.0MB. Max. memory is 16.1GB. [2025-02-07 22:16:24,602 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:16:24,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.14ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 56.1MB in the end (delta: 48.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 22:16:24,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 314.90ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 48.6MB in the end (delta: 7.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2025-02-07 22:16:24,603 INFO L158 Benchmark]: Boogie Preprocessor took 488.91ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 48.6MB in the beginning and 376.5MB in the end (delta: -327.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2025-02-07 22:16:24,603 INFO L158 Benchmark]: IcfgBuilder took 3398.87ms. Allocated memory is still 478.2MB. Free memory was 376.5MB in the beginning and 125.0MB in the end (delta: 251.5MB). Peak memory consumption was 252.1MB. Max. memory is 16.1GB. [2025-02-07 22:16:24,604 INFO L158 Benchmark]: TraceAbstraction took 7099.74ms. Allocated memory was 478.2MB in the beginning and 419.4MB in the end (delta: -58.7MB). Free memory was 125.0MB in the beginning and 133.9MB in the end (delta: -8.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:16:24,604 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 419.4MB. Free memory was 133.9MB in the beginning and 133.9MB in the end (delta: 35.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:16:24,605 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.14ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 56.1MB in the end (delta: 48.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 314.90ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 48.6MB in the end (delta: 7.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 488.91ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 48.6MB in the beginning and 376.5MB in the end (delta: -327.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * IcfgBuilder took 3398.87ms. Allocated memory is still 478.2MB. Free memory was 376.5MB in the beginning and 125.0MB in the end (delta: 251.5MB). Peak memory consumption was 252.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7099.74ms. Allocated memory was 478.2MB in the beginning and 419.4MB in the end (delta: -58.7MB). Free memory was 125.0MB in the beginning and 133.9MB in the end (delta: -8.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 419.4MB. Free memory was 133.9MB in the beginning and 133.9MB in the end (delta: 35.6kB). There was no memory consumed. 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, 1212 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3470 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3470 mSDsluCounter, 26191 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17807 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8103 IncrementalHoareTripleChecker+Invalid, 8105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8384 mSDtfsCounter, 8103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1275occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1076 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 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-02-07 22:16:24,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:16:26,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:16:26,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:16:26,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:16:26,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:16:26,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:16:26,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:16:26,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:16:26,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:16:26,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:16:26,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:16:26,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:16:26,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:16:26,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:16:26,710 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:16:26,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:16:26,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:16:26,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:16:26,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:16:26,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:16:26,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:16:26,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:16:26,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:16:26,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:16:26,713 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2025-02-07 22:16:26,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:16:26,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:16:26,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:16:26,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:16:26,970 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:16:26,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-02-07 22:16:28,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82c89f21f/417340b735d9499593cdbcf2b321f0b5/FLAGd0435e9e2 [2025-02-07 22:16:28,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:16:28,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-02-07 22:16:28,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82c89f21f/417340b735d9499593cdbcf2b321f0b5/FLAGd0435e9e2 [2025-02-07 22:16:28,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82c89f21f/417340b735d9499593cdbcf2b321f0b5 [2025-02-07 22:16:28,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:16:28,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:16:28,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:16:28,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:16:28,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:16:28,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:16:28" (1/1) ... [2025-02-07 22:16:28,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1885dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:28, skipping insertion in model container [2025-02-07 22:16:28,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:16:28" (1/1) ... [2025-02-07 22:16:28,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:16:28,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:16:29,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:16:29,062 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:16:29,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-02-07 22:16:29,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:16:29,170 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:16:29,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29 WrapperNode [2025-02-07 22:16:29,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:16:29,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:16:29,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:16:29,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:16:29,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,243 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1093 [2025-02-07 22:16:29,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:16:29,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:16:29,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:16:29,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:16:29,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,278 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-02-07 22:16:29,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:16:29,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:16:29,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:16:29,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:16:29,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (1/1) ... [2025-02-07 22:16:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:16:29,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:16:29,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:16:29,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:16:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:16:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:16:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:16:29,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:16:29,569 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:16:29,570 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:16:30,352 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-07 22:16:30,352 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:16:30,359 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:16:30,359 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:16:30,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:16:30 BoogieIcfgContainer [2025-02-07 22:16:30,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:16:30,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:16:30,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:16:30,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:16:30,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:16:28" (1/3) ... [2025-02-07 22:16:30,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb5482a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:16:30, skipping insertion in model container [2025-02-07 22:16:30,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:16:29" (2/3) ... [2025-02-07 22:16:30,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb5482a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:16:30, skipping insertion in model container [2025-02-07 22:16:30,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:16:30" (3/3) ... [2025-02-07 22:16:30,368 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-02-07 22:16:30,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:16:30,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:16:30,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:16:30,423 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;@159eab86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:16:30,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:16:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-02-07 22:16:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:16:30,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:30,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:16:30,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:30,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:16:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:16:30,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474023416] [2025-02-07 22:16:30,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:16:30,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:16:30,446 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:16:30,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:16:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:16:30,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:16:30,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:30,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 22:16:30,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:16:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:16:30,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:16:30,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:16:30,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474023416] [2025-02-07 22:16:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474023416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:16:30,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:16:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:16:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149890464] [2025-02-07 22:16:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:16:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:16:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:16:30,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:16:30,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:16:30,876 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 22:16:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:16:30,969 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:16:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:16:30,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-07 22:16:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:16:30,976 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:16:30,976 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:16:30,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-07 22:16:30,983 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-02-07 22:16:30,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:16:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:16:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:16:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-07 22:16:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:16:31,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:16:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:16:31,014 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:16:31,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 22:16:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:16:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:16:31,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:16:31,015 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:16:31,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 22:16:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:16:31,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:16:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:16:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:16:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:16:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494856194] [2025-02-07 22:16:31,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:16:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:16:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:16:31,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:16:31,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 22:16:31,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:16:31,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:16:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:16:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:16:31,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-07 22:16:31,540 INFO L279 TraceCheckSpWp]: Computing forward predicates...