./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.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.vcegar_QF_BV_pj_icu_icctl_p4.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 ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:10:15,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:10:15,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:10:15,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:10:15,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:10:15,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:10:15,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:10:15,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:10:15,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:10:15,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:10:15,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:10:15,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:10:15,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:10:15,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:10:15,562 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:10:15,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:10:15,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:10:15,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:10:15,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:10:15,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:15,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:10:15,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:10:15,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:10:15,565 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 -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2025-02-08 00:10:15,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:10:15,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:10:15,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:10:15,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:10:15,948 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:10:15,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-02-08 00:10:17,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/464b1d62e/b97e92f0cb274a64b987e53c70a7f6e8/FLAG4cd7973c1 [2025-02-08 00:10:17,920 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:10:17,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-02-08 00:10:17,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/464b1d62e/b97e92f0cb274a64b987e53c70a7f6e8/FLAG4cd7973c1 [2025-02-08 00:10:17,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/464b1d62e/b97e92f0cb274a64b987e53c70a7f6e8 [2025-02-08 00:10:17,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:10:17,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:10:17,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:17,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:10:17,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:10:17,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:17" (1/1) ... [2025-02-08 00:10:17,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3c6702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:17, skipping insertion in model container [2025-02-08 00:10:17,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:17" (1/1) ... [2025-02-08 00:10:18,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:10:18,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2025-02-08 00:10:18,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:18,672 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:10:18,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2025-02-08 00:10:18,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:18,929 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:10:18,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18 WrapperNode [2025-02-08 00:10:18,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:18,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:18,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:10:18,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:10:18,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:19,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:19,613 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4812 [2025-02-08 00:10:19,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:19,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:10:19,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:10:19,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:10:19,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:19,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:19,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,014 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-08 00:10:20,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:10:20,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:10:20,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:10:20,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:10:20,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (1/1) ... [2025-02-08 00:10:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:20,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:20,545 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-08 00:10:20,549 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-08 00:10:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:10:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:10:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:10:20,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:10:21,046 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:10:21,048 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:10:26,341 INFO L? ?]: Removed 3113 outVars from TransFormulas that were not future-live. [2025-02-08 00:10:26,341 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:10:26,546 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:10:26,546 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:10:26,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:26 BoogieIcfgContainer [2025-02-08 00:10:26,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:10:26,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:10:26,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:10:26,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:10:26,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:10:17" (1/3) ... [2025-02-08 00:10:26,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b5c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:26, skipping insertion in model container [2025-02-08 00:10:26,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:18" (2/3) ... [2025-02-08 00:10:26,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b5c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:26, skipping insertion in model container [2025-02-08 00:10:26,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:26" (3/3) ... [2025-02-08 00:10:26,560 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-02-08 00:10:26,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:10:26,580 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c that has 1 procedures, 1108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:10:26,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:10:26,700 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;@108f278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:10:26,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:10:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 1108 states, 1106 states have (on average 1.5) internal successors, (1659), 1107 states have internal predecessors, (1659), 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-08 00:10:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 00:10:26,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:26,719 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-08 00:10:26,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:26,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2036936840, now seen corresponding path program 1 times [2025-02-08 00:10:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:26,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147608467] [2025-02-08 00:10:26,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:26,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:26,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 00:10:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 00:10:27,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:27,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:27,946 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-08 00:10:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147608467] [2025-02-08 00:10:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147608467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118183050] [2025-02-08 00:10:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:27,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:27,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:27,987 INFO L87 Difference]: Start difference. First operand has 1108 states, 1106 states have (on average 1.5) internal successors, (1659), 1107 states have internal predecessors, (1659), 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 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:28,841 INFO L93 Difference]: Finished difference Result 2099 states and 3145 transitions. [2025-02-08 00:10:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-08 00:10:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:28,874 INFO L225 Difference]: With dead ends: 2099 [2025-02-08 00:10:28,875 INFO L226 Difference]: Without dead ends: 1108 [2025-02-08 00:10:28,885 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-08 00:10:28,888 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 0 mSDsluCounter, 2753 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:28,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4132 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:10:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-02-08 00:10:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-02-08 00:10:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.4977416440831075) internal successors, (1658), 1107 states have internal predecessors, (1658), 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-08 00:10:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1658 transitions. [2025-02-08 00:10:29,011 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1658 transitions. Word has length 80 [2025-02-08 00:10:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1658 transitions. [2025-02-08 00:10:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1658 transitions. [2025-02-08 00:10:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 00:10:29,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:29,015 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-08 00:10:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:10:29,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:29,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1274786598, now seen corresponding path program 1 times [2025-02-08 00:10:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067145978] [2025-02-08 00:10:29,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:29,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 00:10:29,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 00:10:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:29,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:10:29,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:29,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067145978] [2025-02-08 00:10:29,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067145978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:29,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:29,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:29,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416008428] [2025-02-08 00:10:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:29,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:29,440 INFO L87 Difference]: Start difference. First operand 1108 states and 1658 transitions. Second operand has 4 states, 4 states have (on average 20.25) 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-08 00:10:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:30,136 INFO L93 Difference]: Finished difference Result 2101 states and 3144 transitions. [2025-02-08 00:10:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) 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-08 00:10:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:30,142 INFO L225 Difference]: With dead ends: 2101 [2025-02-08 00:10:30,144 INFO L226 Difference]: Without dead ends: 1110 [2025-02-08 00:10:30,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:30,148 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 0 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:30,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4129 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:10:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-02-08 00:10:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-02-08 00:10:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.496844003606853) internal successors, (1660), 1109 states have internal predecessors, (1660), 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-08 00:10:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1660 transitions. [2025-02-08 00:10:30,181 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1660 transitions. Word has length 81 [2025-02-08 00:10:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:30,184 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1660 transitions. [2025-02-08 00:10:30,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) 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-08 00:10:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1660 transitions. [2025-02-08 00:10:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 00:10:30,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:30,188 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-08 00:10:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:10:30,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1067832003, now seen corresponding path program 1 times [2025-02-08 00:10:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156792490] [2025-02-08 00:10:30,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:30,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 00:10:30,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 00:10:30,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:31,326 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-08 00:10:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156792490] [2025-02-08 00:10:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156792490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:10:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294426191] [2025-02-08 00:10:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:31,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:31,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:31,328 INFO L87 Difference]: Start difference. First operand 1110 states and 1660 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:32,662 INFO L93 Difference]: Finished difference Result 2991 states and 4473 transitions. [2025-02-08 00:10:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-08 00:10:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:32,672 INFO L225 Difference]: With dead ends: 2991 [2025-02-08 00:10:32,673 INFO L226 Difference]: Without dead ends: 1998 [2025-02-08 00:10:32,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:10:32,677 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 4233 mSDsluCounter, 4853 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4233 SdHoareTripleChecker+Valid, 6207 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:32,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4233 Valid, 6207 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:10:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2025-02-08 00:10:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1120. [2025-02-08 00:10:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 1.4950848972296693) internal successors, (1673), 1119 states have internal predecessors, (1673), 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-08 00:10:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1673 transitions. [2025-02-08 00:10:32,765 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1673 transitions. Word has length 82 [2025-02-08 00:10:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:32,765 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1673 transitions. [2025-02-08 00:10:32,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1673 transitions. [2025-02-08 00:10:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:10:32,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:32,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:32,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:10:32,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:32,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1257717709, now seen corresponding path program 1 times [2025-02-08 00:10:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720146118] [2025-02-08 00:10:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:32,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:10:32,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:10:32,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:32,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:33,642 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-08 00:10:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720146118] [2025-02-08 00:10:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720146118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:33,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 00:10:33,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411202572] [2025-02-08 00:10:33,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:33,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:10:33,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:33,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:10:33,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:10:33,646 INFO L87 Difference]: Start difference. First operand 1120 states and 1673 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 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-08 00:10:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:35,559 INFO L93 Difference]: Finished difference Result 2995 states and 4476 transitions. [2025-02-08 00:10:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:10:35,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 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 83 [2025-02-08 00:10:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:35,569 INFO L225 Difference]: With dead ends: 2995 [2025-02-08 00:10:35,569 INFO L226 Difference]: Without dead ends: 2002 [2025-02-08 00:10:35,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:10:35,575 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 4249 mSDsluCounter, 8097 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 9448 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:35,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 9448 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 00:10:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-02-08 00:10:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1122. [2025-02-08 00:10:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4942016057091883) internal successors, (1675), 1121 states have internal predecessors, (1675), 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-08 00:10:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1675 transitions. [2025-02-08 00:10:35,616 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1675 transitions. Word has length 83 [2025-02-08 00:10:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:35,616 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1675 transitions. [2025-02-08 00:10:35,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 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-08 00:10:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1675 transitions. [2025-02-08 00:10:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:10:35,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:35,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:35,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:10:35,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:35,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash -277621858, now seen corresponding path program 1 times [2025-02-08 00:10:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:35,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202151122] [2025-02-08 00:10:35,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:35,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:10:35,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:10:35,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:35,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:36,566 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-08 00:10:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:36,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202151122] [2025-02-08 00:10:36,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202151122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:36,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:36,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:10:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113298477] [2025-02-08 00:10:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:36,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:36,568 INFO L87 Difference]: Start difference. First operand 1122 states and 1675 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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-08 00:10:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:38,010 INFO L93 Difference]: Finished difference Result 2996 states and 4477 transitions. [2025-02-08 00:10:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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 84 [2025-02-08 00:10:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:38,018 INFO L225 Difference]: With dead ends: 2996 [2025-02-08 00:10:38,019 INFO L226 Difference]: Without dead ends: 2003 [2025-02-08 00:10:38,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:10:38,022 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 4230 mSDsluCounter, 5414 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:38,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 6770 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:10:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-02-08 00:10:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1133. [2025-02-08 00:10:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4929328621908127) internal successors, (1690), 1132 states have internal predecessors, (1690), 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-08 00:10:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1690 transitions. [2025-02-08 00:10:38,057 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1690 transitions. Word has length 84 [2025-02-08 00:10:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:38,057 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1690 transitions. [2025-02-08 00:10:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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-08 00:10:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1690 transitions. [2025-02-08 00:10:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:10:38,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:38,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:38,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:10:38,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:38,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2048078735, now seen corresponding path program 1 times [2025-02-08 00:10:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77354392] [2025-02-08 00:10:38,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:10:38,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:10:38,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:38,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:38,658 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-08 00:10:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77354392] [2025-02-08 00:10:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77354392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820880547] [2025-02-08 00:10:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:38,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:38,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:38,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:38,662 INFO L87 Difference]: Start difference. First operand 1133 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-08 00:10:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:39,193 INFO L93 Difference]: Finished difference Result 2129 states and 3179 transitions. [2025-02-08 00:10:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-02-08 00:10:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:39,199 INFO L225 Difference]: With dead ends: 2129 [2025-02-08 00:10:39,200 INFO L226 Difference]: Without dead ends: 1124 [2025-02-08 00:10:39,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:39,204 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 0 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:39,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2751 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-02-08 00:10:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2025-02-08 00:10:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 1.4924309884238647) internal successors, (1676), 1123 states have internal predecessors, (1676), 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-08 00:10:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1676 transitions. [2025-02-08 00:10:39,234 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1676 transitions. Word has length 84 [2025-02-08 00:10:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:39,234 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1676 transitions. [2025-02-08 00:10:39,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-08 00:10:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1676 transitions. [2025-02-08 00:10:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:10:39,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:39,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:39,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:10:39,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 871922478, now seen corresponding path program 1 times [2025-02-08 00:10:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:39,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321129322] [2025-02-08 00:10:39,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:39,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:10:39,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:10:39,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:39,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:40,081 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-08 00:10:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321129322] [2025-02-08 00:10:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321129322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:10:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358148957] [2025-02-08 00:10:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:40,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:40,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:40,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:40,083 INFO L87 Difference]: Start difference. First operand 1124 states and 1676 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-08 00:10:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:40,897 INFO L93 Difference]: Finished difference Result 2130 states and 3179 transitions. [2025-02-08 00:10:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:40,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-02-08 00:10:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:40,903 INFO L225 Difference]: With dead ends: 2130 [2025-02-08 00:10:40,903 INFO L226 Difference]: Without dead ends: 1138 [2025-02-08 00:10:40,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:10:40,906 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 39 mSDsluCounter, 4128 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5501 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:40,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5501 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:10:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-08 00:10:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1130. [2025-02-08 00:10:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.491585473870682) internal successors, (1684), 1129 states have internal predecessors, (1684), 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-08 00:10:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1684 transitions. [2025-02-08 00:10:40,935 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1684 transitions. Word has length 85 [2025-02-08 00:10:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1684 transitions. [2025-02-08 00:10:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-08 00:10:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1684 transitions. [2025-02-08 00:10:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:10:40,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:40,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:40,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:10:40,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:40,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash -867173323, now seen corresponding path program 1 times [2025-02-08 00:10:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277116240] [2025-02-08 00:10:40,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:10:41,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:10:41,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:41,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:41,314 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-08 00:10:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277116240] [2025-02-08 00:10:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277116240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289729720] [2025-02-08 00:10:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:41,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:10:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:41,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:10:41,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:10:41,316 INFO L87 Difference]: Start difference. First operand 1130 states and 1684 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-08 00:10:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:42,300 INFO L93 Difference]: Finished difference Result 2987 states and 4459 transitions. [2025-02-08 00:10:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-02-08 00:10:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:42,308 INFO L225 Difference]: With dead ends: 2987 [2025-02-08 00:10:42,309 INFO L226 Difference]: Without dead ends: 1989 [2025-02-08 00:10:42,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:42,312 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 4198 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:42,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 4064 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:10:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2025-02-08 00:10:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1126. [2025-02-08 00:10:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 1.4906666666666666) internal successors, (1677), 1125 states have internal predecessors, (1677), 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-08 00:10:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1677 transitions. [2025-02-08 00:10:42,346 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1677 transitions. Word has length 85 [2025-02-08 00:10:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:42,346 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1677 transitions. [2025-02-08 00:10:42,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-08 00:10:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1677 transitions. [2025-02-08 00:10:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:10:42,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:42,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:42,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:10:42,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 338869753, now seen corresponding path program 1 times [2025-02-08 00:10:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380875050] [2025-02-08 00:10:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:42,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:10:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:10:42,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:42,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:43,233 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-08 00:10:43,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:43,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380875050] [2025-02-08 00:10:43,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380875050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:43,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:43,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:10:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715530116] [2025-02-08 00:10:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:43,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:10:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:43,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:10:43,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:10:43,236 INFO L87 Difference]: Start difference. First operand 1126 states and 1677 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-08 00:10:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:44,777 INFO L93 Difference]: Finished difference Result 2126 states and 3172 transitions. [2025-02-08 00:10:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:10:44,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 86 [2025-02-08 00:10:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:44,783 INFO L225 Difference]: With dead ends: 2126 [2025-02-08 00:10:44,784 INFO L226 Difference]: Without dead ends: 1134 [2025-02-08 00:10:44,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:10:44,788 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 15 mSDsluCounter, 8197 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9569 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:44,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9569 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:10:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-02-08 00:10:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1132. [2025-02-08 00:10:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4898320070733864) internal successors, (1685), 1131 states have internal predecessors, (1685), 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-08 00:10:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1685 transitions. [2025-02-08 00:10:44,819 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1685 transitions. Word has length 86 [2025-02-08 00:10:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:44,819 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1685 transitions. [2025-02-08 00:10:44,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-08 00:10:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1685 transitions. [2025-02-08 00:10:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:10:44,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:44,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:44,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:10:44,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 524513610, now seen corresponding path program 1 times [2025-02-08 00:10:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318174988] [2025-02-08 00:10:44,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:44,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:10:44,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:10:44,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:44,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:45,984 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-08 00:10:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:45,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318174988] [2025-02-08 00:10:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318174988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:45,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 00:10:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330187169] [2025-02-08 00:10:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:45,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:10:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:45,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:10:45,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:10:45,987 INFO L87 Difference]: Start difference. First operand 1132 states and 1685 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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-08 00:10:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:48,262 INFO L93 Difference]: Finished difference Result 2145 states and 3199 transitions. [2025-02-08 00:10:48,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:10:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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 87 [2025-02-08 00:10:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:48,267 INFO L225 Difference]: With dead ends: 2145 [2025-02-08 00:10:48,268 INFO L226 Difference]: Without dead ends: 1147 [2025-02-08 00:10:48,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:10:48,270 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 5 mSDsluCounter, 13622 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14988 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:48,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14988 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 00:10:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-02-08 00:10:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1144. [2025-02-08 00:10:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4908136482939633) internal successors, (1704), 1143 states have internal predecessors, (1704), 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-08 00:10:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1704 transitions. [2025-02-08 00:10:48,298 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1704 transitions. Word has length 87 [2025-02-08 00:10:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:48,298 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1704 transitions. [2025-02-08 00:10:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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-08 00:10:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1704 transitions. [2025-02-08 00:10:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 00:10:48,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:48,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:48,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:10:48,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash 8855243, now seen corresponding path program 1 times [2025-02-08 00:10:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432058770] [2025-02-08 00:10:48,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:48,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:10:48,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:10:48,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:48,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:10:48,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:10:48,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:10:48,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:10:48,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:48,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:10:48,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:10:48,570 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:10:48,571 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:10:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:10:48,576 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:48,654 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:10:48,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:10:48,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:10:48 BoogieIcfgContainer [2025-02-08 00:10:48,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:10:48,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:10:48,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:10:48,688 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:10:48,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:26" (3/4) ... [2025-02-08 00:10:48,691 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:10:48,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:10:48,693 INFO L158 Benchmark]: Toolchain (without parser) took 30711.95ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 120.4MB in the beginning and 154.5MB in the end (delta: -34.1MB). Peak memory consumption was 257.5MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,693 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:10:48,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 949.31ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 36.1MB in the end (delta: 83.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 683.33ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 36.1MB in the beginning and 82.7MB in the end (delta: -46.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,695 INFO L158 Benchmark]: Boogie Preprocessor took 885.88ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 82.7MB in the beginning and 245.2MB in the end (delta: -162.5MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,695 INFO L158 Benchmark]: IcfgBuilder took 6043.13ms. Allocated memory was 369.1MB in the beginning and 755.0MB in the end (delta: 385.9MB). Free memory was 245.2MB in the beginning and 478.8MB in the end (delta: -233.6MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,695 INFO L158 Benchmark]: TraceAbstraction took 22136.49ms. Allocated memory was 755.0MB in the beginning and 453.0MB in the end (delta: -302.0MB). Free memory was 478.8MB in the beginning and 154.5MB in the end (delta: 324.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,695 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 453.0MB. Free memory was 154.5MB in the beginning and 154.5MB in the end (delta: 39.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:10:48,697 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.65ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 949.31ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 36.1MB in the end (delta: 83.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 683.33ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 36.1MB in the beginning and 82.7MB in the end (delta: -46.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 885.88ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 82.7MB in the beginning and 245.2MB in the end (delta: -162.5MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * IcfgBuilder took 6043.13ms. Allocated memory was 369.1MB in the beginning and 755.0MB in the end (delta: 385.9MB). Free memory was 245.2MB in the beginning and 478.8MB in the end (delta: -233.6MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22136.49ms. Allocated memory was 755.0MB in the beginning and 453.0MB in the end (delta: -302.0MB). Free memory was 478.8MB in the beginning and 154.5MB in the end (delta: 324.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 453.0MB. Free memory was 154.5MB in the beginning and 154.5MB in the end (delta: 39.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 376. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_28 = 0; [L46] const SORT_21 var_32 = 2; [L47] const SORT_21 var_35 = 4; [L48] const SORT_21 var_38 = 64; [L49] const SORT_3 var_45 = 1; [L50] const SORT_3 var_49 = 0; [L51] const SORT_6 var_134 = 0; [L52] const SORT_21 var_728 = 8; [L53] const SORT_21 var_748 = 16; [L54] const SORT_21 var_763 = 32; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_356; [L72] SORT_3 input_378; [L73] SORT_3 input_393; [L74] SORT_3 input_408; [L75] SORT_3 input_423; [L76] SORT_3 input_438; [L77] SORT_3 input_453; [L78] SORT_3 input_468; [L79] SORT_3 input_483; [L80] SORT_3 input_498; [L81] SORT_3 input_513; [L82] SORT_3 input_528; [L83] SORT_3 input_543; [L84] SORT_3 input_558; [L85] SORT_3 input_573; [L86] SORT_3 input_588; [L87] SORT_3 input_604; [L88] SORT_3 input_606; [L89] SORT_3 input_608; [L90] SORT_3 input_610; [L91] SORT_3 input_612; [L92] SORT_3 input_614; [L93] SORT_3 input_616; [L94] SORT_3 input_618; [L95] SORT_3 input_623; [L96] SORT_21 input_664; [L97] SORT_21 input_665; [L98] SORT_21 input_666; [L99] SORT_21 input_667; [L100] SORT_21 input_670; [L101] SORT_21 input_674; [L102] SORT_21 input_678; [L103] SORT_21 input_686; [L104] SORT_21 input_690; [L105] SORT_21 input_692; [L106] SORT_21 input_696; [L107] SORT_21 input_699; [L108] SORT_21 input_703; [L109] SORT_21 input_708; [L110] SORT_21 input_712; [L111] SORT_21 input_717; [L112] SORT_21 input_719; [L113] SORT_21 input_720; [L114] SORT_21 input_722; [L115] SORT_21 input_726; [L116] SORT_21 input_732; [L117] SORT_21 input_739; [L118] SORT_21 input_740; [L119] SORT_21 input_742; [L120] SORT_21 input_746; [L121] SORT_21 input_752; [L122] SORT_21 input_754; [L123] SORT_21 input_755; [L124] SORT_21 input_757; [L125] SORT_21 input_761; [L126] SORT_21 input_767; [L127] SORT_21 input_771; [L128] SORT_21 input_776; [L129] SORT_21 input_778; [L130] SORT_21 input_784; [L131] SORT_21 input_796; [L132] SORT_3 input_801; [L133] SORT_3 input_810; [L134] SORT_3 input_829; [L135] SORT_3 input_836; [L136] SORT_3 input_847; [L137] SORT_3 input_853; [L138] SORT_3 input_859; [L139] SORT_3 input_865; [L140] SORT_3 input_871; [L141] SORT_3 input_877; [L142] SORT_3 input_883; [L143] SORT_3 input_889; [L144] SORT_3 input_895; [L145] SORT_3 input_901; [L146] SORT_3 input_907; [L147] SORT_3 input_913; [L148] SORT_3 input_919; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L151] SORT_21 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L152] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L153] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L154] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L155] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L156] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L157] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L158] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L159] SORT_3 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L160] SORT_3 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L161] SORT_3 state_104 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L162] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L163] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L164] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L165] SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L166] SORT_3 state_130 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L167] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L168] SORT_3 state_140 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L169] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L170] SORT_3 state_154 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L171] SORT_3 state_157 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L172] SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L173] SORT_3 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L174] SORT_3 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L175] SORT_3 state_187 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L176] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L177] SORT_3 state_209 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L178] SORT_3 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_27_arg_1 = var_22; [L183] state_26 = init_27_arg_1 [L184] SORT_3 init_51_arg_1 = var_49; [L185] state_50 = init_51_arg_1 [L186] SORT_3 init_53_arg_1 = var_49; [L187] state_52 = init_53_arg_1 [L188] SORT_3 init_55_arg_1 = var_49; [L189] state_54 = init_55_arg_1 [L190] SORT_3 init_59_arg_1 = var_49; [L191] state_58 = init_59_arg_1 [L192] SORT_3 init_63_arg_1 = var_49; [L193] state_62 = init_63_arg_1 [L194] SORT_3 init_67_arg_1 = var_49; [L195] state_66 = init_67_arg_1 [L196] SORT_3 init_83_arg_1 = var_49; [L197] state_82 = init_83_arg_1 [L198] SORT_3 init_100_arg_1 = var_49; [L199] state_99 = init_100_arg_1 [L200] SORT_3 init_103_arg_1 = var_49; [L201] state_102 = init_103_arg_1 [L202] SORT_3 init_105_arg_1 = var_49; [L203] state_104 = init_105_arg_1 [L204] SORT_3 init_109_arg_1 = var_49; [L205] state_108 = init_109_arg_1 [L206] SORT_3 init_113_arg_1 = var_49; [L207] state_112 = init_113_arg_1 [L208] SORT_3 init_118_arg_1 = var_49; [L209] state_117 = init_118_arg_1 [L210] SORT_3 init_121_arg_1 = var_49; [L211] state_120 = init_121_arg_1 [L212] SORT_3 init_131_arg_1 = var_49; [L213] state_130 = init_131_arg_1 [L214] SORT_3 init_138_arg_1 = var_49; [L215] state_137 = init_138_arg_1 [L216] SORT_3 init_141_arg_1 = var_49; [L217] state_140 = init_141_arg_1 [L218] SORT_3 init_150_arg_1 = var_49; [L219] state_149 = init_150_arg_1 [L220] SORT_3 init_155_arg_1 = var_49; [L221] state_154 = init_155_arg_1 [L222] SORT_3 init_158_arg_1 = var_49; [L223] state_157 = init_158_arg_1 [L224] SORT_3 init_170_arg_1 = var_49; [L225] state_169 = init_170_arg_1 [L226] SORT_3 init_180_arg_1 = var_49; [L227] state_179 = init_180_arg_1 [L228] SORT_3 init_185_arg_1 = var_49; [L229] state_184 = init_185_arg_1 [L230] SORT_3 init_188_arg_1 = var_49; [L231] state_187 = init_188_arg_1 [L232] SORT_3 init_197_arg_1 = var_49; [L233] state_196 = init_197_arg_1 [L234] SORT_3 init_210_arg_1 = var_49; [L235] state_209 = init_210_arg_1 [L236] SORT_3 init_223_arg_1 = var_49; [L237] state_222 = init_223_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_356 = __VERIFIER_nondet_uchar() [L257] input_378 = __VERIFIER_nondet_uchar() [L258] input_393 = __VERIFIER_nondet_uchar() [L259] input_408 = __VERIFIER_nondet_uchar() [L260] input_423 = __VERIFIER_nondet_uchar() [L261] input_438 = __VERIFIER_nondet_uchar() [L262] input_453 = __VERIFIER_nondet_uchar() [L263] input_468 = __VERIFIER_nondet_uchar() [L264] input_483 = __VERIFIER_nondet_uchar() [L265] input_498 = __VERIFIER_nondet_uchar() [L266] input_513 = __VERIFIER_nondet_uchar() [L267] input_528 = __VERIFIER_nondet_uchar() [L268] input_543 = __VERIFIER_nondet_uchar() [L269] input_558 = __VERIFIER_nondet_uchar() [L270] input_573 = __VERIFIER_nondet_uchar() [L271] input_588 = __VERIFIER_nondet_uchar() [L272] input_604 = __VERIFIER_nondet_uchar() [L273] input_606 = __VERIFIER_nondet_uchar() [L274] input_608 = __VERIFIER_nondet_uchar() [L275] input_610 = __VERIFIER_nondet_uchar() [L276] input_612 = __VERIFIER_nondet_uchar() [L277] input_614 = __VERIFIER_nondet_uchar() [L278] input_616 = __VERIFIER_nondet_uchar() [L279] input_618 = __VERIFIER_nondet_uchar() [L280] input_623 = __VERIFIER_nondet_uchar() [L281] input_664 = __VERIFIER_nondet_uchar() [L282] input_665 = __VERIFIER_nondet_uchar() [L283] input_666 = __VERIFIER_nondet_uchar() [L284] input_667 = __VERIFIER_nondet_uchar() [L285] input_670 = __VERIFIER_nondet_uchar() [L286] input_674 = __VERIFIER_nondet_uchar() [L287] input_678 = __VERIFIER_nondet_uchar() [L288] input_686 = __VERIFIER_nondet_uchar() [L289] input_690 = __VERIFIER_nondet_uchar() [L290] input_692 = __VERIFIER_nondet_uchar() [L291] input_696 = __VERIFIER_nondet_uchar() [L292] input_699 = __VERIFIER_nondet_uchar() [L293] input_703 = __VERIFIER_nondet_uchar() [L294] input_708 = __VERIFIER_nondet_uchar() [L295] input_712 = __VERIFIER_nondet_uchar() [L296] input_717 = __VERIFIER_nondet_uchar() [L297] input_719 = __VERIFIER_nondet_uchar() [L298] input_720 = __VERIFIER_nondet_uchar() [L299] input_722 = __VERIFIER_nondet_uchar() [L300] input_726 = __VERIFIER_nondet_uchar() [L301] input_732 = __VERIFIER_nondet_uchar() [L302] input_739 = __VERIFIER_nondet_uchar() [L303] input_740 = __VERIFIER_nondet_uchar() [L304] input_742 = __VERIFIER_nondet_uchar() [L305] input_746 = __VERIFIER_nondet_uchar() [L306] input_752 = __VERIFIER_nondet_uchar() [L307] input_754 = __VERIFIER_nondet_uchar() [L308] input_755 = __VERIFIER_nondet_uchar() [L309] input_757 = __VERIFIER_nondet_uchar() [L310] input_761 = __VERIFIER_nondet_uchar() [L311] input_767 = __VERIFIER_nondet_uchar() [L312] input_771 = __VERIFIER_nondet_uchar() [L313] input_776 = __VERIFIER_nondet_uchar() [L314] input_778 = __VERIFIER_nondet_uchar() [L315] input_784 = __VERIFIER_nondet_uchar() [L316] input_796 = __VERIFIER_nondet_uchar() [L317] input_801 = __VERIFIER_nondet_uchar() [L318] input_810 = __VERIFIER_nondet_uchar() [L319] input_829 = __VERIFIER_nondet_uchar() [L320] input_836 = __VERIFIER_nondet_uchar() [L321] input_847 = __VERIFIER_nondet_uchar() [L322] input_853 = __VERIFIER_nondet_uchar() [L323] input_859 = __VERIFIER_nondet_uchar() [L324] input_865 = __VERIFIER_nondet_uchar() [L325] input_871 = __VERIFIER_nondet_uchar() [L326] input_877 = __VERIFIER_nondet_uchar() [L327] input_883 = __VERIFIER_nondet_uchar() [L328] input_889 = __VERIFIER_nondet_uchar() [L329] input_895 = __VERIFIER_nondet_uchar() [L330] input_901 = __VERIFIER_nondet_uchar() [L331] input_907 = __VERIFIER_nondet_uchar() [L332] input_913 = __VERIFIER_nondet_uchar() [L333] input_919 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_29_arg_0 = state_26; [L340] SORT_21 var_29_arg_1 = var_28; [L341] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L342] SORT_21 var_30_arg_0 = state_26; [L343] SORT_21 var_30_arg_1 = var_22; [L344] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L345] SORT_3 var_31_arg_0 = var_29; [L346] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_31_arg_0=0, var_31_arg_1=1, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L347] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L348] SORT_21 var_33_arg_0 = state_26; [L349] SORT_21 var_33_arg_1 = var_32; [L350] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L351] SORT_3 var_34_arg_0 = var_31; [L352] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_34_arg_0=1, var_34_arg_1=0, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L353] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L354] SORT_21 var_36_arg_0 = state_26; [L355] SORT_21 var_36_arg_1 = var_35; [L356] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L357] SORT_3 var_37_arg_0 = var_34; [L358] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_37_arg_0=1, var_37_arg_1=0, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L359] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L360] SORT_21 var_39_arg_0 = state_26; [L361] SORT_21 var_39_arg_1 = var_38; [L362] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L363] SORT_3 var_40_arg_0 = var_37; [L364] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_40_arg_0=1, var_40_arg_1=0, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L365] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_25; [L367] SORT_3 var_41_arg_1 = var_40; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_41_arg_0=1, var_41_arg_1=1, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] EXPR var_41_arg_0 & var_41_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L368] SORT_3 var_41 = var_41_arg_0 & var_41_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_22; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_42; [L373] SORT_3 var_43 = ~var_43_arg_0; [L374] SORT_3 var_44_arg_0 = var_41; [L375] SORT_3 var_44_arg_1 = var_43; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_44_arg_0=1, var_44_arg_1=-2, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] EXPR var_44_arg_0 | var_44_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L376] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L377] SORT_3 var_46_arg_0 = var_44; [L378] SORT_3 var_46 = ~var_46_arg_0; [L379] SORT_3 var_47_arg_0 = var_45; [L380] SORT_3 var_47_arg_1 = var_46; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_47_arg_0=1, var_47_arg_1=-255, var_49=0, var_728=8, var_748=16, var_763=32] [L381] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L381] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L382] EXPR var_47 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32] [L382] var_47 = var_47 & mask_SORT_3 [L383] SORT_3 bad_48_arg_0 = var_47; [L384] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16969 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16969 mSDsluCounter, 67559 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53896 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14578 IncrementalHoareTripleChecker+Invalid, 14583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 13663 mSDtfsCounter, 14578 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1144occurred in iteration=10, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 3504 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 2655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-08 00:10:48,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.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 ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:10:51,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:10:51,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:10:51,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:10:51,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:10:51,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:10:51,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:10:51,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:10:51,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:10:51,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:10:51,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:10:51,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:10:51,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:10:51,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:10:51,212 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:10:51,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:10:51,213 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:10:51,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:10:51,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:51,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:10:51,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:10:51,215 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 -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e [2025-02-08 00:10:51,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:10:51,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:10:51,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:10:51,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:10:51,562 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:10:51,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-02-08 00:10:52,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/492f4301c/1e0aefe1051141d397f73c20e37ece64/FLAG10414b21f [2025-02-08 00:10:53,427 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:10:53,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-02-08 00:10:53,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/492f4301c/1e0aefe1051141d397f73c20e37ece64/FLAG10414b21f [2025-02-08 00:10:53,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/492f4301c/1e0aefe1051141d397f73c20e37ece64 [2025-02-08 00:10:53,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:10:53,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:10:53,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:53,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:10:53,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:10:53,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464ffd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53, skipping insertion in model container [2025-02-08 00:10:53,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:10:53,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2025-02-08 00:10:54,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:54,226 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:10:54,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281] [2025-02-08 00:10:54,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:54,475 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:10:54,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54 WrapperNode [2025-02-08 00:10:54,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:54,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:54,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:10:54,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:10:54,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,637 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2612 [2025-02-08 00:10:54,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:54,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:10:54,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:10:54,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:10:54,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,730 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-08 00:10:54,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:10:54,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:10:54,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:10:54,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:10:54,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (1/1) ... [2025-02-08 00:10:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:54,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:54,901 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-08 00:10:54,909 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-08 00:10:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:10:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:10:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:10:54,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:10:55,348 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:10:55,350 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:10:58,605 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2025-02-08 00:10:58,605 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:10:58,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:10:58,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:10:58,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:58 BoogieIcfgContainer [2025-02-08 00:10:58,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:10:58,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:10:58,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:10:58,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:10:58,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:10:53" (1/3) ... [2025-02-08 00:10:58,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33556ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:58, skipping insertion in model container [2025-02-08 00:10:58,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:54" (2/3) ... [2025-02-08 00:10:58,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33556ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:58, skipping insertion in model container [2025-02-08 00:10:58,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:58" (3/3) ... [2025-02-08 00:10:58,628 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c [2025-02-08 00:10:58,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:10:58,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:10:58,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:10:58,709 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;@7392aebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:10:58,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:10:58,716 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-08 00:10:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:10:58,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:58,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:10:58,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:58,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:10:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:10:58,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370381173] [2025-02-08 00:10:58,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:58,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:10:58,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:58,740 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-08 00:10:58,742 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-08 00:10:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:10:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:10:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:59,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 00:10:59,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:10:59,573 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-08 00:10:59,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:10:59,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:10:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370381173] [2025-02-08 00:10:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370381173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:59,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:59,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:10:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431971853] [2025-02-08 00:10:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:59,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:59,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:10:59,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:59,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:59,605 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-08 00:10:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:59,714 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-08 00:10:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:59,717 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-08 00:10:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:59,725 INFO L225 Difference]: With dead ends: 15 [2025-02-08 00:10:59,726 INFO L226 Difference]: Without dead ends: 8 [2025-02-08 00:10:59,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 00:10:59,734 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-08 00:10:59,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:10:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-08 00:10:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 00:10:59,759 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-08 00:10:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:10:59,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:10:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:59,764 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:10:59,764 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-08 00:10:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:10:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:10:59,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:59,764 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:10:59,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:10:59,966 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-08 00:10:59,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:59,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:59,969 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:10:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:10:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084036542] [2025-02-08 00:10:59,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:10:59,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:59,975 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-08 00:10:59,977 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-08 00:11:00,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:11:00,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:11:00,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:00,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:00,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-08 00:11:00,865 INFO L279 TraceCheckSpWp]: Computing forward predicates...