./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.toy_lock_4.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 dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:06:00,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:06:00,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:06:00,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:06:00,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:06:00,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:06:00,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:06:00,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:06:00,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:06:00,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:06:00,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:06:00,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:06:00,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:06:00,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:06:00,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:06:00,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:06:00,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:06:00,789 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 -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2025-02-05 20:06:00,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:06:01,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:06:01,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:06:01,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:06:01,004 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:06:01,005 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.toy_lock_4.c [2025-02-05 20:06:02,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8056ca3dd/86629a44c8854ce780fa44d212f0593e/FLAG18828014a [2025-02-05 20:06:02,457 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:06:02,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2025-02-05 20:06:02,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8056ca3dd/86629a44c8854ce780fa44d212f0593e/FLAG18828014a [2025-02-05 20:06:02,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8056ca3dd/86629a44c8854ce780fa44d212f0593e [2025-02-05 20:06:02,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:06:02,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:06:02,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:06:02,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:06:02,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:06:02,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:02,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6279d83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02, skipping insertion in model container [2025-02-05 20:06:02,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:02,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:06:02,647 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.toy_lock_4.c[1250,1263] [2025-02-05 20:06:02,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:06:02,808 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:06:02,816 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.toy_lock_4.c[1250,1263] [2025-02-05 20:06:02,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:06:02,913 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:06:02,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02 WrapperNode [2025-02-05 20:06:02,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:06:02,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:06:02,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:06:02,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:06:02,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:02,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,022 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1371 [2025-02-05 20:06:03,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:06:03,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:06:03,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:06:03,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:06:03,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,125 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-05 20:06:03,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:06:03,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:06:03,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:06:03,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:06:03,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (1/1) ... [2025-02-05 20:06:03,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:06:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:06:03,225 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-05 20:06:03,227 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-05 20:06:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:06:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:06:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:06:03,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:06:03,422 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:06:03,424 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:06:05,578 INFO L? ?]: Removed 948 outVars from TransFormulas that were not future-live. [2025-02-05 20:06:05,578 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:06:05,618 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:06:05,619 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:06:05,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:06:05 BoogieIcfgContainer [2025-02-05 20:06:05,619 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:06:05,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:06:05,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:06:05,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:06:05,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:06:02" (1/3) ... [2025-02-05 20:06:05,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4372ce7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:06:05, skipping insertion in model container [2025-02-05 20:06:05,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:02" (2/3) ... [2025-02-05 20:06:05,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4372ce7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:06:05, skipping insertion in model container [2025-02-05 20:06:05,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:06:05" (3/3) ... [2025-02-05 20:06:05,627 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2025-02-05 20:06:05,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:06:05,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.toy_lock_4.c that has 1 procedures, 246 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:06:05,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:06:05,690 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;@2ae8ab2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:06:05,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:06:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 244 states have (on average 1.4959016393442623) internal successors, (365), 245 states have internal predecessors, (365), 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-05 20:06:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 20:06:05,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:05,701 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] [2025-02-05 20:06:05,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:05,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:05,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1314278447, now seen corresponding path program 1 times [2025-02-05 20:06:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411919314] [2025-02-05 20:06:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:05,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 20:06:05,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 20:06:05,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:05,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:06,389 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-05 20:06:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411919314] [2025-02-05 20:06:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411919314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:06,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:06,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:06:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361294018] [2025-02-05 20:06:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:06,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:06:06,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:06,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:06:06,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:06:06,410 INFO L87 Difference]: Start difference. First operand has 246 states, 244 states have (on average 1.4959016393442623) internal successors, (365), 245 states have internal predecessors, (365), 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 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-05 20:06:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:06,572 INFO L93 Difference]: Finished difference Result 425 states and 633 transitions. [2025-02-05 20:06:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:06:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 75 [2025-02-05 20:06:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:06,581 INFO L225 Difference]: With dead ends: 425 [2025-02-05 20:06:06,581 INFO L226 Difference]: Without dead ends: 245 [2025-02-05 20:06:06,583 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-05 20:06:06,587 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:06,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 895 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-05 20:06:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-05 20:06:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4877049180327868) internal successors, (363), 244 states have internal predecessors, (363), 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-05 20:06:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 363 transitions. [2025-02-05 20:06:06,624 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 363 transitions. Word has length 75 [2025-02-05 20:06:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:06,625 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 363 transitions. [2025-02-05 20:06:06,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-05 20:06:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 363 transitions. [2025-02-05 20:06:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 20:06:06,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:06,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:06:06,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2083246880, now seen corresponding path program 1 times [2025-02-05 20:06:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559807891] [2025-02-05 20:06:06,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:06,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 20:06:06,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 20:06:06,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:06,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:06,856 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-05 20:06:06,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559807891] [2025-02-05 20:06:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559807891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:06,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:06:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444710352] [2025-02-05 20:06:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:06:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:06,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:06:06,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:06:06,860 INFO L87 Difference]: Start difference. First operand 245 states and 363 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:07,008 INFO L93 Difference]: Finished difference Result 426 states and 631 transitions. [2025-02-05 20:06:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:06:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 20:06:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:07,010 INFO L225 Difference]: With dead ends: 426 [2025-02-05 20:06:07,010 INFO L226 Difference]: Without dead ends: 247 [2025-02-05 20:06:07,011 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-05 20:06:07,011 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:07,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 892 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-05 20:06:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-02-05 20:06:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.483739837398374) internal successors, (365), 246 states have internal predecessors, (365), 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-05 20:06:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 365 transitions. [2025-02-05 20:06:07,026 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 365 transitions. Word has length 76 [2025-02-05 20:06:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:07,027 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 365 transitions. [2025-02-05 20:06:07,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 365 transitions. [2025-02-05 20:06:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 20:06:07,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:07,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:06:07,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:07,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1775365548, now seen corresponding path program 1 times [2025-02-05 20:06:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512273628] [2025-02-05 20:06:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:07,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 20:06:07,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 20:06:07,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:07,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:07,366 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-05 20:06:07,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512273628] [2025-02-05 20:06:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512273628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:06:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216286471] [2025-02-05 20:06:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:06:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:07,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:06:07,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:06:07,368 INFO L87 Difference]: Start difference. First operand 247 states and 365 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:07,538 INFO L93 Difference]: Finished difference Result 432 states and 638 transitions. [2025-02-05 20:06:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:06:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 20:06:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:07,540 INFO L225 Difference]: With dead ends: 432 [2025-02-05 20:06:07,540 INFO L226 Difference]: Without dead ends: 251 [2025-02-05 20:06:07,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:07,541 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 298 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:07,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 875 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-05 20:06:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2025-02-05 20:06:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4779116465863453) internal successors, (368), 249 states have internal predecessors, (368), 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-05 20:06:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2025-02-05 20:06:07,548 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 77 [2025-02-05 20:06:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:07,548 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2025-02-05 20:06:07,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2025-02-05 20:06:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 20:06:07,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:07,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:07,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:06:07,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:07,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1090119813, now seen corresponding path program 1 times [2025-02-05 20:06:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724695966] [2025-02-05 20:06:07,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:07,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 20:06:07,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 20:06:07,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:07,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:07,747 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-05 20:06:07,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724695966] [2025-02-05 20:06:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724695966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:07,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:07,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:06:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712908981] [2025-02-05 20:06:07,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:07,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:06:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:07,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:06:07,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:07,749 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:07,894 INFO L93 Difference]: Finished difference Result 440 states and 647 transitions. [2025-02-05 20:06:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:06:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 20:06:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:07,895 INFO L225 Difference]: With dead ends: 440 [2025-02-05 20:06:07,895 INFO L226 Difference]: Without dead ends: 256 [2025-02-05 20:06:07,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:07,896 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 4 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:07,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1186 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-05 20:06:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-05 20:06:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4745098039215687) internal successors, (376), 255 states have internal predecessors, (376), 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-05 20:06:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2025-02-05 20:06:07,902 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 78 [2025-02-05 20:06:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:07,903 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2025-02-05 20:06:07,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2025-02-05 20:06:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 20:06:07,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:07,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:06:07,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 907887339, now seen corresponding path program 1 times [2025-02-05 20:06:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369130739] [2025-02-05 20:06:07,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:07,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 20:06:08,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 20:06:08,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:08,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:08,773 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-05 20:06:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:08,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369130739] [2025-02-05 20:06:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369130739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:08,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:06:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35152442] [2025-02-05 20:06:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:06:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:08,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:06:08,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:06:08,776 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:12,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:12,142 INFO L93 Difference]: Finished difference Result 550 states and 803 transitions. [2025-02-05 20:06:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:06:12,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 20:06:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:12,144 INFO L225 Difference]: With dead ends: 550 [2025-02-05 20:06:12,145 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 20:06:12,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:06:12,146 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 567 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:12,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1954 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 20:06:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 20:06:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 288. [2025-02-05 20:06:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4773519163763067) internal successors, (424), 287 states have internal predecessors, (424), 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-05 20:06:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 424 transitions. [2025-02-05 20:06:12,164 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 424 transitions. Word has length 78 [2025-02-05 20:06:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:12,164 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 424 transitions. [2025-02-05 20:06:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 424 transitions. [2025-02-05 20:06:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 20:06:12,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:12,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:12,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:06:12,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash -683781110, now seen corresponding path program 1 times [2025-02-05 20:06:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753780957] [2025-02-05 20:06:12,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:12,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 20:06:12,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 20:06:12,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:12,774 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-05 20:06:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753780957] [2025-02-05 20:06:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753780957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:12,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:12,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:06:12,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647337324] [2025-02-05 20:06:12,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:12,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:06:12,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:12,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:06:12,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:06:12,775 INFO L87 Difference]: Start difference. First operand 288 states and 424 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:13,307 INFO L93 Difference]: Finished difference Result 554 states and 808 transitions. [2025-02-05 20:06:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:06:13,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 20:06:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:13,311 INFO L225 Difference]: With dead ends: 554 [2025-02-05 20:06:13,311 INFO L226 Difference]: Without dead ends: 359 [2025-02-05 20:06:13,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:13,312 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 441 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:13,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 859 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:06:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-05 20:06:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 288. [2025-02-05 20:06:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4738675958188154) internal successors, (423), 287 states have internal predecessors, (423), 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-05 20:06:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2025-02-05 20:06:13,323 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 79 [2025-02-05 20:06:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:13,323 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2025-02-05 20:06:13,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2025-02-05 20:06:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 20:06:13,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:13,324 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-05 20:06:13,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:06:13,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:13,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1770599211, now seen corresponding path program 1 times [2025-02-05 20:06:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:13,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91290066] [2025-02-05 20:06:13,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:13,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 20:06:13,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 20:06:13,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:13,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:13,861 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-05 20:06:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91290066] [2025-02-05 20:06:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91290066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:13,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:06:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593424256] [2025-02-05 20:06:13,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:13,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:06:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:13,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:06:13,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:06:13,862 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-05 20:06:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:14,852 INFO L93 Difference]: Finished difference Result 551 states and 802 transitions. [2025-02-05 20:06:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:06:14,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-05 20:06:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:14,854 INFO L225 Difference]: With dead ends: 551 [2025-02-05 20:06:14,854 INFO L226 Difference]: Without dead ends: 359 [2025-02-05 20:06:14,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:14,855 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 437 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:14,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 859 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:06:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-05 20:06:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 291. [2025-02-05 20:06:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4655172413793103) internal successors, (425), 290 states have internal predecessors, (425), 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-05 20:06:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2025-02-05 20:06:14,864 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 80 [2025-02-05 20:06:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:14,864 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2025-02-05 20:06:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-05 20:06:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2025-02-05 20:06:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 20:06:14,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:14,865 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-05 20:06:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:06:14,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash -229806546, now seen corresponding path program 1 times [2025-02-05 20:06:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833908519] [2025-02-05 20:06:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:14,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 20:06:14,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 20:06:14,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:15,296 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-05 20:06:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833908519] [2025-02-05 20:06:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833908519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:06:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951654226] [2025-02-05 20:06:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:06:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:15,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:06:15,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:15,297 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-05 20:06:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:15,528 INFO L93 Difference]: Finished difference Result 489 states and 715 transitions. [2025-02-05 20:06:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:06:15,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-05 20:06:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:15,530 INFO L225 Difference]: With dead ends: 489 [2025-02-05 20:06:15,530 INFO L226 Difference]: Without dead ends: 299 [2025-02-05 20:06:15,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:15,530 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 3 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:15,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1759 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:06:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-05 20:06:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2025-02-05 20:06:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.465986394557823) internal successors, (431), 294 states have internal predecessors, (431), 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-05 20:06:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 431 transitions. [2025-02-05 20:06:15,535 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 431 transitions. Word has length 81 [2025-02-05 20:06:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:15,536 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 431 transitions. [2025-02-05 20:06:15,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-05 20:06:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 431 transitions. [2025-02-05 20:06:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 20:06:15,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:15,537 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-05 20:06:15,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:06:15,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash 611984645, now seen corresponding path program 1 times [2025-02-05 20:06:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:15,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276004080] [2025-02-05 20:06:15,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:15,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 20:06:15,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 20:06:15,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:15,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:16,040 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-05 20:06:16,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276004080] [2025-02-05 20:06:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276004080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:06:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888857307] [2025-02-05 20:06:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:16,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:06:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:06:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:06:16,042 INFO L87 Difference]: Start difference. First operand 295 states and 431 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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-05 20:06:18,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:20,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:21,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:21,735 INFO L93 Difference]: Finished difference Result 570 states and 827 transitions. [2025-02-05 20:06:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:06:21,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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-05 20:06:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:21,737 INFO L225 Difference]: With dead ends: 570 [2025-02-05 20:06:21,737 INFO L226 Difference]: Without dead ends: 374 [2025-02-05 20:06:21,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:06:21,737 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 445 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:21,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1570 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-05 20:06:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-05 20:06:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 307. [2025-02-05 20:06:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 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-05 20:06:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 447 transitions. [2025-02-05 20:06:21,744 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 447 transitions. Word has length 81 [2025-02-05 20:06:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:21,744 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 447 transitions. [2025-02-05 20:06:21,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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-05 20:06:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 447 transitions. [2025-02-05 20:06:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 20:06:21,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:21,745 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-05 20:06:21,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:06:21,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash 78476833, now seen corresponding path program 1 times [2025-02-05 20:06:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655442393] [2025-02-05 20:06:21,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:21,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 20:06:21,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 20:06:21,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:21,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:22,167 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-05 20:06:22,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:22,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655442393] [2025-02-05 20:06:22,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655442393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:22,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:22,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:06:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611967720] [2025-02-05 20:06:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:22,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:06:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:22,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:06:22,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:06:22,169 INFO L87 Difference]: Start difference. First operand 307 states and 447 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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-05 20:06:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:22,379 INFO L93 Difference]: Finished difference Result 517 states and 753 transitions. [2025-02-05 20:06:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:06:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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-05 20:06:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:22,381 INFO L225 Difference]: With dead ends: 517 [2025-02-05 20:06:22,381 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 20:06:22,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:06:22,382 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 6 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:22,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1458 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:06:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 20:06:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 310. [2025-02-05 20:06:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4627831715210355) internal successors, (452), 309 states have internal predecessors, (452), 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-05 20:06:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 452 transitions. [2025-02-05 20:06:22,396 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 452 transitions. Word has length 81 [2025-02-05 20:06:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:22,396 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 452 transitions. [2025-02-05 20:06:22,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 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-05 20:06:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 452 transitions. [2025-02-05 20:06:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 20:06:22,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:22,397 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-05 20:06:22,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:06:22,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:22,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1286486394, now seen corresponding path program 1 times [2025-02-05 20:06:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126160676] [2025-02-05 20:06:22,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:22,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 20:06:22,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 20:06:22,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:22,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:22,688 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-05 20:06:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126160676] [2025-02-05 20:06:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126160676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:06:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539171616] [2025-02-05 20:06:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:22,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:06:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:22,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:06:22,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:06:22,690 INFO L87 Difference]: Start difference. First operand 310 states and 452 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 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-05 20:06:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:24,411 INFO L93 Difference]: Finished difference Result 573 states and 832 transitions. [2025-02-05 20:06:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:06:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 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-05 20:06:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:24,413 INFO L225 Difference]: With dead ends: 573 [2025-02-05 20:06:24,413 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 20:06:24,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:06:24,414 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 551 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:24,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1422 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:06:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 20:06:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2025-02-05 20:06:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.4568690095846646) internal successors, (456), 313 states have internal predecessors, (456), 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-05 20:06:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 456 transitions. [2025-02-05 20:06:24,420 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 456 transitions. Word has length 82 [2025-02-05 20:06:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 456 transitions. [2025-02-05 20:06:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 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-05 20:06:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 456 transitions. [2025-02-05 20:06:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 20:06:24,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:24,421 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-05 20:06:24,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:06:24,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:24,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:24,421 INFO L85 PathProgramCache]: Analyzing trace with hash 270362805, now seen corresponding path program 1 times [2025-02-05 20:06:24,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:24,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403772729] [2025-02-05 20:06:24,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:24,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:24,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 20:06:24,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 20:06:24,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:24,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:24,647 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-05 20:06:24,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403772729] [2025-02-05 20:06:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403772729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:06:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049732977] [2025-02-05 20:06:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:24,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:06:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:24,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:06:24,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:24,648 INFO L87 Difference]: Start difference. First operand 314 states and 456 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-05 20:06:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:24,879 INFO L93 Difference]: Finished difference Result 523 states and 761 transitions. [2025-02-05 20:06:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:06:24,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-05 20:06:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:24,881 INFO L225 Difference]: With dead ends: 523 [2025-02-05 20:06:24,881 INFO L226 Difference]: Without dead ends: 324 [2025-02-05 20:06:24,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:24,882 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 6 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:24,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2049 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:06:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-05 20:06:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2025-02-05 20:06:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.4545454545454546) internal successors, (464), 319 states have internal predecessors, (464), 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-05 20:06:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 464 transitions. [2025-02-05 20:06:24,886 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 464 transitions. Word has length 82 [2025-02-05 20:06:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 464 transitions. [2025-02-05 20:06:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-05 20:06:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 464 transitions. [2025-02-05 20:06:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 20:06:24,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:24,887 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-05 20:06:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:06:24,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1560679856, now seen corresponding path program 1 times [2025-02-05 20:06:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871274923] [2025-02-05 20:06:24,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:24,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 20:06:24,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 20:06:24,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:24,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:25,284 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-05 20:06:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:25,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871274923] [2025-02-05 20:06:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871274923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:25,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:25,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:06:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328137831] [2025-02-05 20:06:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:25,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:06:25,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:25,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:06:25,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:25,286 INFO L87 Difference]: Start difference. First operand 320 states and 464 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-05 20:06:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:25,535 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2025-02-05 20:06:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:06:25,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-05 20:06:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:25,537 INFO L225 Difference]: With dead ends: 536 [2025-02-05 20:06:25,537 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 20:06:25,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:25,537 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:25,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1743 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:06:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 20:06:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-05 20:06:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4461538461538461) internal successors, (470), 325 states have internal predecessors, (470), 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-05 20:06:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 470 transitions. [2025-02-05 20:06:25,543 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 470 transitions. Word has length 82 [2025-02-05 20:06:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:25,543 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 470 transitions. [2025-02-05 20:06:25,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-05 20:06:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 470 transitions. [2025-02-05 20:06:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 20:06:25,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:25,544 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-05 20:06:25,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:06:25,544 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:25,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:25,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1467494211, now seen corresponding path program 1 times [2025-02-05 20:06:25,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:25,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069707005] [2025-02-05 20:06:25,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:25,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:25,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 20:06:25,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 20:06:25,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:25,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:25,803 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-05 20:06:25,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069707005] [2025-02-05 20:06:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069707005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:06:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795617365] [2025-02-05 20:06:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:25,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:06:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:25,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:06:25,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:06:25,804 INFO L87 Difference]: Start difference. First operand 326 states and 470 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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-05 20:06:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:25,917 INFO L93 Difference]: Finished difference Result 543 states and 783 transitions. [2025-02-05 20:06:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:06:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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-05 20:06:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:25,919 INFO L225 Difference]: With dead ends: 543 [2025-02-05 20:06:25,919 INFO L226 Difference]: Without dead ends: 320 [2025-02-05 20:06:25,920 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-05 20:06:25,920 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:25,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-05 20:06:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-02-05 20:06:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.4357366771159874) internal successors, (458), 319 states have internal predecessors, (458), 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-05 20:06:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 458 transitions. [2025-02-05 20:06:25,926 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 458 transitions. Word has length 82 [2025-02-05 20:06:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:25,926 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 458 transitions. [2025-02-05 20:06:25,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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-05 20:06:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 458 transitions. [2025-02-05 20:06:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:06:25,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:25,929 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-05 20:06:25,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:06:25,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash -713856054, now seen corresponding path program 1 times [2025-02-05 20:06:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683369413] [2025-02-05 20:06:25,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:25,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:06:25,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:06:25,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:25,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:26,366 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-05 20:06:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683369413] [2025-02-05 20:06:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683369413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:26,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:26,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:06:26,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775296130] [2025-02-05 20:06:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:26,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:06:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:26,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:06:26,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:06:26,368 INFO L87 Difference]: Start difference. First operand 320 states and 458 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) 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-05 20:06:27,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:29,024 INFO L93 Difference]: Finished difference Result 601 states and 860 transitions. [2025-02-05 20:06:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:06:29,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) 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-05 20:06:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:29,026 INFO L225 Difference]: With dead ends: 601 [2025-02-05 20:06:29,026 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 20:06:29,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:06:29,028 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 444 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:29,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1579 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 20:06:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 20:06:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 329. [2025-02-05 20:06:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4329268292682926) internal successors, (470), 328 states have internal predecessors, (470), 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-05 20:06:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 470 transitions. [2025-02-05 20:06:29,034 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 470 transitions. Word has length 83 [2025-02-05 20:06:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:29,035 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 470 transitions. [2025-02-05 20:06:29,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) 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-05 20:06:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 470 transitions. [2025-02-05 20:06:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:06:29,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:29,036 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-05 20:06:29,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:06:29,036 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:29,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1847067905, now seen corresponding path program 1 times [2025-02-05 20:06:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:29,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021417764] [2025-02-05 20:06:29,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:29,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:06:29,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:06:29,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:29,308 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-05 20:06:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:29,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021417764] [2025-02-05 20:06:29,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021417764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:29,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:29,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:06:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733507281] [2025-02-05 20:06:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:29,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:06:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:29,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:06:29,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:06:29,310 INFO L87 Difference]: Start difference. First operand 329 states and 470 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-05 20:06:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:29,403 INFO L93 Difference]: Finished difference Result 538 states and 771 transitions. [2025-02-05 20:06:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:06:29,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-05 20:06:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:29,405 INFO L225 Difference]: With dead ends: 538 [2025-02-05 20:06:29,405 INFO L226 Difference]: Without dead ends: 308 [2025-02-05 20:06:29,405 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-05 20:06:29,406 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:29,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-05 20:06:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-02-05 20:06:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4429967426710097) internal successors, (443), 307 states have internal predecessors, (443), 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-05 20:06:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 443 transitions. [2025-02-05 20:06:29,412 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 443 transitions. Word has length 83 [2025-02-05 20:06:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:29,412 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 443 transitions. [2025-02-05 20:06:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-05 20:06:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 443 transitions. [2025-02-05 20:06:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:06:29,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:29,413 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-05 20:06:29,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:06:29,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -322960225, now seen corresponding path program 1 times [2025-02-05 20:06:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079912315] [2025-02-05 20:06:29,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:29,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:06:29,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:06:29,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:29,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:29,684 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-05 20:06:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079912315] [2025-02-05 20:06:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079912315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:29,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:06:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95726648] [2025-02-05 20:06:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:06:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:29,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:06:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:06:29,686 INFO L87 Difference]: Start difference. First operand 308 states and 443 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-05 20:06:30,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:31,319 INFO L93 Difference]: Finished difference Result 571 states and 820 transitions. [2025-02-05 20:06:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:06:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-05 20:06:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:31,320 INFO L225 Difference]: With dead ends: 571 [2025-02-05 20:06:31,320 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 20:06:31,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:06:31,321 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 543 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:31,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1412 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 20:06:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 20:06:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 312. [2025-02-05 20:06:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.437299035369775) internal successors, (447), 311 states have internal predecessors, (447), 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-05 20:06:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 447 transitions. [2025-02-05 20:06:31,327 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 447 transitions. Word has length 84 [2025-02-05 20:06:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:31,327 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 447 transitions. [2025-02-05 20:06:31,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-05 20:06:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 447 transitions. [2025-02-05 20:06:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:06:31,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:31,328 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-05 20:06:31,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:06:31,328 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:31,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1064957606, now seen corresponding path program 1 times [2025-02-05 20:06:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:31,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831056290] [2025-02-05 20:06:31,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:31,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:06:31,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:06:31,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:31,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:31,584 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-05 20:06:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:31,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831056290] [2025-02-05 20:06:31,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831056290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:31,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:31,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:06:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273623177] [2025-02-05 20:06:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:06:31,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:31,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:06:31,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:31,586 INFO L87 Difference]: Start difference. First operand 312 states and 447 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05 20:06:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:31,786 INFO L93 Difference]: Finished difference Result 520 states and 748 transitions. [2025-02-05 20:06:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:06:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05 20:06:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:31,788 INFO L225 Difference]: With dead ends: 520 [2025-02-05 20:06:31,788 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 20:06:31,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:31,788 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 5 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:31,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1735 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:06:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 20:06:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2025-02-05 20:06:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.4353312302839116) internal successors, (455), 317 states have internal predecessors, (455), 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-05 20:06:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 455 transitions. [2025-02-05 20:06:31,793 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 455 transitions. Word has length 84 [2025-02-05 20:06:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:31,793 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 455 transitions. [2025-02-05 20:06:31,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-05 20:06:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 455 transitions. [2025-02-05 20:06:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:06:31,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:31,794 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-05 20:06:31,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:06:31,794 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1561910129, now seen corresponding path program 1 times [2025-02-05 20:06:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:31,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782685383] [2025-02-05 20:06:31,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:31,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:06:31,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:06:31,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:31,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:32,128 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-05 20:06:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782685383] [2025-02-05 20:06:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782685383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:06:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764112023] [2025-02-05 20:06:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:06:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:32,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:06:32,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:06:32,132 INFO L87 Difference]: Start difference. First operand 318 states and 455 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-05 20:06:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:33,115 INFO L93 Difference]: Finished difference Result 582 states and 832 transitions. [2025-02-05 20:06:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:06:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-05 20:06:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:33,116 INFO L225 Difference]: With dead ends: 582 [2025-02-05 20:06:33,116 INFO L226 Difference]: Without dead ends: 378 [2025-02-05 20:06:33,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:33,117 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 414 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 853 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:06:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-05 20:06:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 326. [2025-02-05 20:06:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4307692307692308) internal successors, (465), 325 states have internal predecessors, (465), 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-05 20:06:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 465 transitions. [2025-02-05 20:06:33,122 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 465 transitions. Word has length 84 [2025-02-05 20:06:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 465 transitions. [2025-02-05 20:06:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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-05 20:06:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 465 transitions. [2025-02-05 20:06:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 20:06:33,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:33,123 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-05 20:06:33,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:06:33,123 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash 945646847, now seen corresponding path program 1 times [2025-02-05 20:06:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660048483] [2025-02-05 20:06:33,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:33,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 20:06:33,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 20:06:33,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:33,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:33,506 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-05 20:06:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:33,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660048483] [2025-02-05 20:06:33,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660048483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:33,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:33,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:06:33,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857591745] [2025-02-05 20:06:33,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:06:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:33,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:06:33,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:06:33,508 INFO L87 Difference]: Start difference. First operand 326 states and 465 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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-05 20:06:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:33,843 INFO L93 Difference]: Finished difference Result 545 states and 781 transitions. [2025-02-05 20:06:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:06:33,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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-05 20:06:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:33,844 INFO L225 Difference]: With dead ends: 545 [2025-02-05 20:06:33,844 INFO L226 Difference]: Without dead ends: 329 [2025-02-05 20:06:33,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:06:33,845 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 3 mSDsluCounter, 2573 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:33,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2862 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:06:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-05 20:06:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2025-02-05 20:06:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.4325153374233128) internal successors, (467), 326 states have internal predecessors, (467), 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-05 20:06:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 467 transitions. [2025-02-05 20:06:33,849 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 467 transitions. Word has length 85 [2025-02-05 20:06:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:33,850 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 467 transitions. [2025-02-05 20:06:33,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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-05 20:06:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 467 transitions. [2025-02-05 20:06:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 20:06:33,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:33,850 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-05 20:06:33,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:06:33,851 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1702754177, now seen corresponding path program 1 times [2025-02-05 20:06:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362603815] [2025-02-05 20:06:33,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:33,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 20:06:33,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 20:06:33,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:33,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:34,050 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-05 20:06:34,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362603815] [2025-02-05 20:06:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362603815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:34,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:34,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:06:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779990934] [2025-02-05 20:06:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:34,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:06:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:34,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:06:34,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:34,052 INFO L87 Difference]: Start difference. First operand 327 states and 467 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-05 20:06:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:34,219 INFO L93 Difference]: Finished difference Result 551 states and 790 transitions. [2025-02-05 20:06:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:06:34,219 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-05 20:06:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:34,221 INFO L225 Difference]: With dead ends: 551 [2025-02-05 20:06:34,221 INFO L226 Difference]: Without dead ends: 338 [2025-02-05 20:06:34,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:34,222 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:34,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1455 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:06:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-05 20:06:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2025-02-05 20:06:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.4294294294294294) internal successors, (476), 333 states have internal predecessors, (476), 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-05 20:06:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 476 transitions. [2025-02-05 20:06:34,227 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 476 transitions. Word has length 86 [2025-02-05 20:06:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:34,228 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 476 transitions. [2025-02-05 20:06:34,228 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-05 20:06:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 476 transitions. [2025-02-05 20:06:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 20:06:34,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:34,228 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-05 20:06:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:06:34,229 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1058542190, now seen corresponding path program 1 times [2025-02-05 20:06:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050251453] [2025-02-05 20:06:34,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:34,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 20:06:34,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 20:06:34,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:34,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:34,740 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-05 20:06:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050251453] [2025-02-05 20:06:34,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050251453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:34,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:34,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:06:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979614129] [2025-02-05 20:06:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:34,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:06:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:34,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:06:34,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:06:34,742 INFO L87 Difference]: Start difference. First operand 334 states and 476 transitions. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 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-05 20:06:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:35,528 INFO L93 Difference]: Finished difference Result 599 states and 860 transitions. [2025-02-05 20:06:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:06:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 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-05 20:06:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:35,532 INFO L225 Difference]: With dead ends: 599 [2025-02-05 20:06:35,532 INFO L226 Difference]: Without dead ends: 381 [2025-02-05 20:06:35,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:06:35,533 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 342 mSDsluCounter, 4673 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 4935 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:35,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 4935 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:06:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-05 20:06:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2025-02-05 20:06:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.4335106382978724) internal successors, (539), 376 states have internal predecessors, (539), 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-05 20:06:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 539 transitions. [2025-02-05 20:06:35,538 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 539 transitions. Word has length 87 [2025-02-05 20:06:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:35,538 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 539 transitions. [2025-02-05 20:06:35,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 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-05 20:06:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 539 transitions. [2025-02-05 20:06:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 20:06:35,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:35,539 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-05 20:06:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:06:35,539 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash 876309716, now seen corresponding path program 1 times [2025-02-05 20:06:35,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:35,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364357865] [2025-02-05 20:06:35,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 20:06:35,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 20:06:35,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:35,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:06:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364357865] [2025-02-05 20:06:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364357865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:06:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101319582] [2025-02-05 20:06:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:35,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:06:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:35,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:06:35,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:06:35,942 INFO L87 Difference]: Start difference. First operand 377 states and 539 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-05 20:06:38,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:39,899 INFO L93 Difference]: Finished difference Result 704 states and 1009 transitions. [2025-02-05 20:06:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:06:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-05 20:06:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:39,900 INFO L225 Difference]: With dead ends: 704 [2025-02-05 20:06:39,900 INFO L226 Difference]: Without dead ends: 443 [2025-02-05 20:06:39,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:06:39,901 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 524 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:39,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1938 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 20:06:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-05 20:06:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 389. [2025-02-05 20:06:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.4329896907216495) internal successors, (556), 388 states have internal predecessors, (556), 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-05 20:06:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 556 transitions. [2025-02-05 20:06:39,906 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 556 transitions. Word has length 87 [2025-02-05 20:06:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:39,906 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 556 transitions. [2025-02-05 20:06:39,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-05 20:06:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 556 transitions. [2025-02-05 20:06:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 20:06:39,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:39,907 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-05 20:06:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:06:39,907 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1067287473, now seen corresponding path program 1 times [2025-02-05 20:06:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290607457] [2025-02-05 20:06:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:39,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 20:06:39,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 20:06:39,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:39,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:40,153 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-05 20:06:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290607457] [2025-02-05 20:06:40,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290607457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:06:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658867322] [2025-02-05 20:06:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:40,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:06:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:40,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:06:40,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:06:40,154 INFO L87 Difference]: Start difference. First operand 389 states and 556 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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-05 20:06:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:40,261 INFO L93 Difference]: Finished difference Result 655 states and 942 transitions. [2025-02-05 20:06:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:06:40,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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-05 20:06:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:40,263 INFO L225 Difference]: With dead ends: 655 [2025-02-05 20:06:40,263 INFO L226 Difference]: Without dead ends: 386 [2025-02-05 20:06:40,263 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-05 20:06:40,263 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:40,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-05 20:06:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-02-05 20:06:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.4207792207792207) internal successors, (547), 385 states have internal predecessors, (547), 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-05 20:06:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 547 transitions. [2025-02-05 20:06:40,268 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 547 transitions. Word has length 87 [2025-02-05 20:06:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:40,268 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 547 transitions. [2025-02-05 20:06:40,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 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-05 20:06:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 547 transitions. [2025-02-05 20:06:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 20:06:40,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:40,269 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-05 20:06:40,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:06:40,269 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:40,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1351882341, now seen corresponding path program 1 times [2025-02-05 20:06:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705432053] [2025-02-05 20:06:40,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:40,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 20:06:40,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 20:06:40,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:40,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:40,698 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-05 20:06:40,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705432053] [2025-02-05 20:06:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705432053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 20:06:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334342477] [2025-02-05 20:06:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:40,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:06:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:40,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:06:40,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:06:40,700 INFO L87 Difference]: Start difference. First operand 386 states and 547 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 15 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-05 20:06:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:41,068 INFO L93 Difference]: Finished difference Result 662 states and 943 transitions. [2025-02-05 20:06:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 20:06:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 15 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-05 20:06:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:41,070 INFO L225 Difference]: With dead ends: 662 [2025-02-05 20:06:41,070 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 20:06:41,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:06:41,070 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 8 mSDsluCounter, 3112 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:41,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3398 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:06:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 20:06:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2025-02-05 20:06:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.4215938303341902) internal successors, (553), 389 states have internal predecessors, (553), 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-05 20:06:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2025-02-05 20:06:41,075 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 87 [2025-02-05 20:06:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:41,075 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2025-02-05 20:06:41,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 15 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-05 20:06:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2025-02-05 20:06:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 20:06:41,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:41,075 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-05 20:06:41,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:06:41,076 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:41,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash -702253, now seen corresponding path program 1 times [2025-02-05 20:06:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154863175] [2025-02-05 20:06:41,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:41,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 20:06:41,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 20:06:41,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:41,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:41,579 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-05 20:06:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154863175] [2025-02-05 20:06:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154863175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:41,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:41,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 20:06:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123843023] [2025-02-05 20:06:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:41,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 20:06:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:41,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 20:06:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:06:41,580 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 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-05 20:06:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:41,995 INFO L93 Difference]: Finished difference Result 748 states and 1066 transitions. [2025-02-05 20:06:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:06:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 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 88 [2025-02-05 20:06:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:41,997 INFO L225 Difference]: With dead ends: 748 [2025-02-05 20:06:41,997 INFO L226 Difference]: Without dead ends: 479 [2025-02-05 20:06:41,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:06:41,998 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 9 mSDsluCounter, 3534 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3808 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:41,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3808 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:06:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-05 20:06:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-02-05 20:06:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.4163179916317992) internal successors, (677), 478 states have internal predecessors, (677), 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-05 20:06:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 677 transitions. [2025-02-05 20:06:42,003 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 677 transitions. Word has length 88 [2025-02-05 20:06:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:42,004 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 677 transitions. [2025-02-05 20:06:42,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 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-05 20:06:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 677 transitions. [2025-02-05 20:06:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 20:06:42,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:42,004 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-05 20:06:42,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:06:42,005 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:42,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash 161199721, now seen corresponding path program 1 times [2025-02-05 20:06:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785271397] [2025-02-05 20:06:42,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:42,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 20:06:42,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 20:06:42,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:42,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:42,322 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-05 20:06:42,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785271397] [2025-02-05 20:06:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785271397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:06:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173146298] [2025-02-05 20:06:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:06:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:42,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:06:42,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:06:42,324 INFO L87 Difference]: Start difference. First operand 479 states and 677 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-05 20:06:44,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:06:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:46,375 INFO L93 Difference]: Finished difference Result 878 states and 1244 transitions. [2025-02-05 20:06:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:06:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2025-02-05 20:06:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:46,376 INFO L225 Difference]: With dead ends: 878 [2025-02-05 20:06:46,376 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 20:06:46,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:06:46,377 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 482 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:46,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 849 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 20:06:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 20:06:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 477. [2025-02-05 20:06:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.415966386554622) internal successors, (674), 476 states have internal predecessors, (674), 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-05 20:06:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 674 transitions. [2025-02-05 20:06:46,384 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 674 transitions. Word has length 88 [2025-02-05 20:06:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:46,384 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 674 transitions. [2025-02-05 20:06:46,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-05 20:06:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 674 transitions. [2025-02-05 20:06:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 20:06:46,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:46,385 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-05 20:06:46,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:06:46,385 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:46,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1027365340, now seen corresponding path program 1 times [2025-02-05 20:06:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:46,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241694743] [2025-02-05 20:06:46,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:46,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 20:06:46,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 20:06:46,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:46,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:46,580 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-05 20:06:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:06:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241694743] [2025-02-05 20:06:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241694743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:06:46,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425269118] [2025-02-05 20:06:46,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:46,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:06:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:06:46,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:06:46,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:46,582 INFO L87 Difference]: Start difference. First operand 477 states and 674 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-05 20:06:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:46,730 INFO L93 Difference]: Finished difference Result 853 states and 1211 transitions. [2025-02-05 20:06:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:06:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2025-02-05 20:06:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:46,732 INFO L225 Difference]: With dead ends: 853 [2025-02-05 20:06:46,732 INFO L226 Difference]: Without dead ends: 495 [2025-02-05 20:06:46,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:06:46,733 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 7 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:46,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1450 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:06:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-05 20:06:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 487. [2025-02-05 20:06:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.4156378600823045) internal successors, (688), 486 states have internal predecessors, (688), 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-05 20:06:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 688 transitions. [2025-02-05 20:06:46,740 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 688 transitions. Word has length 88 [2025-02-05 20:06:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:46,740 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 688 transitions. [2025-02-05 20:06:46,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-05 20:06:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 688 transitions. [2025-02-05 20:06:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 20:06:46,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:46,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 20:06:46,741 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1276815129, now seen corresponding path program 1 times [2025-02-05 20:06:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:06:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116174425] [2025-02-05 20:06:46,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:06:46,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 20:06:46,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 20:06:46,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:46,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:06:46,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:06:46,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 20:06:46,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 20:06:46,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:46,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:06:46,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:06:46,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:06:46,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:06:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 20:06:46,858 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 20:06:46,901 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:06:46,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:06:46,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:06:46 BoogieIcfgContainer [2025-02-05 20:06:46,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:06:46,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:06:46,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:06:46,920 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:06:46,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:06:05" (3/4) ... [2025-02-05 20:06:46,922 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:06:46,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:06:46,923 INFO L158 Benchmark]: Toolchain (without parser) took 44427.16ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 103.7MB in the beginning and 653.3MB in the end (delta: -549.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-02-05 20:06:46,923 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 125.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:06:46,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.93ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 66.0MB in the end (delta: 36.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 20:06:46,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.58ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 39.7MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:06:46,924 INFO L158 Benchmark]: Boogie Preprocessor took 175.68ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 77.3MB in the end (delta: -37.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-02-05 20:06:46,924 INFO L158 Benchmark]: IcfgBuilder took 2420.33ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 52.1MB in the end (delta: 25.2MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-02-05 20:06:46,924 INFO L158 Benchmark]: TraceAbstraction took 41297.84ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 51.2MB in the beginning and 657.6MB in the end (delta: -606.4MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. [2025-02-05 20:06:46,924 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 729.8MB. Free memory was 653.4MB in the beginning and 653.3MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:06:46,925 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.51ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 125.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.93ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 66.0MB in the end (delta: 36.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.58ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 39.7MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 175.68ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 77.3MB in the end (delta: -37.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * IcfgBuilder took 2420.33ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 52.1MB in the end (delta: 25.2MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41297.84ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 51.2MB in the beginning and 657.6MB in the end (delta: -606.4MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 729.8MB. Free memory was 653.4MB in the beginning and 653.3MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 191. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_45 = 1; [L37] const SORT_1 var_49 = 1; [L38] const SORT_5 var_60 = 0; [L39] const SORT_3 var_81 = 0; [L40] const SORT_3 var_90 = 1; [L41] const SORT_3 var_99 = 2; [L42] const SORT_3 var_108 = 3; [L44] SORT_1 input_2; [L45] SORT_3 input_4; [L46] SORT_5 input_6; [L47] SORT_1 input_7; [L48] SORT_3 input_8; [L49] SORT_3 input_9; [L50] SORT_5 input_10; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L52] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L53] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L54] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L55] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L56] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L57] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L58] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L59] SORT_1 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L60] SORT_5 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L61] SORT_5 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L62] SORT_5 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L63] SORT_5 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L64] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L65] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L66] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L67] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_13_arg_1 = var_11; [L70] state_12 = init_13_arg_1 [L71] SORT_1 init_16_arg_1 = var_11; [L72] state_15 = init_16_arg_1 [L73] SORT_1 init_21_arg_1 = var_11; [L74] state_20 = init_21_arg_1 [L75] SORT_1 init_27_arg_1 = var_11; [L76] state_26 = init_27_arg_1 [L77] SORT_1 init_51_arg_1 = var_49; [L78] state_50 = init_51_arg_1 [L79] SORT_1 init_53_arg_1 = var_11; [L80] state_52 = init_53_arg_1 [L81] SORT_1 init_55_arg_1 = var_11; [L82] state_54 = init_55_arg_1 [L83] SORT_1 init_57_arg_1 = var_11; [L84] state_56 = init_57_arg_1 [L85] SORT_5 init_59_arg_1 = var_45; [L86] state_58 = init_59_arg_1 [L87] SORT_5 init_62_arg_1 = var_60; [L88] state_61 = init_62_arg_1 [L89] SORT_5 init_64_arg_1 = var_60; [L90] state_63 = init_64_arg_1 [L91] SORT_5 init_66_arg_1 = var_60; [L92] state_65 = init_66_arg_1 [L93] SORT_1 init_69_arg_1 = var_11; [L94] state_68 = init_69_arg_1 [L95] SORT_1 init_71_arg_1 = var_11; [L96] state_70 = init_71_arg_1 [L97] SORT_1 init_73_arg_1 = var_11; [L98] state_72 = init_73_arg_1 [L99] SORT_1 init_75_arg_1 = var_11; [L100] state_74 = init_75_arg_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L103] input_2 = __VERIFIER_nondet_uchar() [L104] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L104] input_2 = input_2 & mask_SORT_1 [L105] input_4 = __VERIFIER_nondet_uchar() [L106] EXPR input_4 & mask_SORT_3 VAL [input_2=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L106] input_4 = input_4 & mask_SORT_3 [L107] input_6 = __VERIFIER_nondet_uchar() [L108] input_7 = __VERIFIER_nondet_uchar() [L109] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_4=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L109] input_7 = input_7 & mask_SORT_1 [L110] input_8 = __VERIFIER_nondet_uchar() [L111] EXPR input_8 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L111] input_8 = input_8 & mask_SORT_3 [L112] input_9 = __VERIFIER_nondet_uchar() [L113] EXPR input_9 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L113] input_9 = input_9 & mask_SORT_3 [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_5 VAL [input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L115] input_10 = input_10 & mask_SORT_5 [L118] SORT_1 var_14_arg_0 = state_12; [L119] SORT_1 var_14_arg_1 = var_11; [L120] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L121] SORT_1 var_17_arg_0 = state_12; [L122] SORT_1 var_17_arg_1 = state_15; [L123] SORT_5 var_17 = var_17_arg_0 != var_17_arg_1; [L124] SORT_5 var_18_arg_0 = var_14; [L125] SORT_5 var_18_arg_1 = var_17; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18_arg_0=1, var_18_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] EXPR var_18_arg_0 | var_18_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] SORT_5 var_18 = var_18_arg_0 | var_18_arg_1; [L127] SORT_1 var_19_arg_0 = state_12; [L128] SORT_1 var_19_arg_1 = var_11; [L129] SORT_5 var_19 = var_19_arg_0 == var_19_arg_1; [L130] SORT_1 var_22_arg_0 = state_12; [L131] SORT_1 var_22_arg_1 = state_20; [L132] SORT_5 var_22 = var_22_arg_0 != var_22_arg_1; [L133] SORT_5 var_23_arg_0 = var_19; [L134] SORT_5 var_23_arg_1 = var_22; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_23_arg_0=1, var_23_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] SORT_5 var_23 = var_23_arg_0 | var_23_arg_1; [L136] SORT_5 var_24_arg_0 = var_18; [L137] SORT_5 var_24_arg_1 = var_23; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24_arg_0=1, var_24_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] SORT_5 var_24 = var_24_arg_0 & var_24_arg_1; [L139] SORT_1 var_25_arg_0 = state_12; [L140] SORT_1 var_25_arg_1 = var_11; [L141] SORT_5 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_1 var_28_arg_0 = state_12; [L143] SORT_1 var_28_arg_1 = state_26; [L144] SORT_5 var_28 = var_28_arg_0 != var_28_arg_1; [L145] SORT_5 var_29_arg_0 = var_25; [L146] SORT_5 var_29_arg_1 = var_28; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_29_arg_0=1, var_29_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] EXPR var_29_arg_0 | var_29_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] SORT_5 var_29 = var_29_arg_0 | var_29_arg_1; [L148] SORT_5 var_30_arg_0 = var_24; [L149] SORT_5 var_30_arg_1 = var_29; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30_arg_0=1, var_30_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] SORT_5 var_30 = var_30_arg_0 & var_30_arg_1; [L151] SORT_1 var_31_arg_0 = state_15; [L152] SORT_1 var_31_arg_1 = var_11; [L153] SORT_5 var_31 = var_31_arg_0 == var_31_arg_1; [L154] SORT_1 var_32_arg_0 = state_15; [L155] SORT_1 var_32_arg_1 = state_20; [L156] SORT_5 var_32 = var_32_arg_0 != var_32_arg_1; [L157] SORT_5 var_33_arg_0 = var_31; [L158] SORT_5 var_33_arg_1 = var_32; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_33_arg_0=1, var_33_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] EXPR var_33_arg_0 | var_33_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] SORT_5 var_33 = var_33_arg_0 | var_33_arg_1; [L160] SORT_5 var_34_arg_0 = var_30; [L161] SORT_5 var_34_arg_1 = var_33; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34_arg_0=1, var_34_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] EXPR var_34_arg_0 & var_34_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] SORT_5 var_34 = var_34_arg_0 & var_34_arg_1; [L163] SORT_1 var_35_arg_0 = state_15; [L164] SORT_1 var_35_arg_1 = var_11; [L165] SORT_5 var_35 = var_35_arg_0 == var_35_arg_1; [L166] SORT_1 var_36_arg_0 = state_15; [L167] SORT_1 var_36_arg_1 = state_26; [L168] SORT_5 var_36 = var_36_arg_0 != var_36_arg_1; [L169] SORT_5 var_37_arg_0 = var_35; [L170] SORT_5 var_37_arg_1 = var_36; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_37_arg_0=1, var_37_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] SORT_5 var_37 = var_37_arg_0 | var_37_arg_1; [L172] SORT_5 var_38_arg_0 = var_34; [L173] SORT_5 var_38_arg_1 = var_37; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38_arg_0=1, var_38_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] SORT_5 var_38 = var_38_arg_0 & var_38_arg_1; [L175] SORT_1 var_39_arg_0 = state_20; [L176] SORT_1 var_39_arg_1 = var_11; [L177] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L178] SORT_1 var_40_arg_0 = state_20; [L179] SORT_1 var_40_arg_1 = state_26; [L180] SORT_5 var_40 = var_40_arg_0 != var_40_arg_1; [L181] SORT_5 var_41_arg_0 = var_39; [L182] SORT_5 var_41_arg_1 = var_40; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_41_arg_0=1, var_41_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] SORT_5 var_41 = var_41_arg_0 | var_41_arg_1; [L184] SORT_5 var_42_arg_0 = var_38; [L185] SORT_5 var_42_arg_1 = var_41; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_42_arg_0=1, var_42_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] SORT_5 var_42 = var_42_arg_0 & var_42_arg_1; [L187] SORT_5 var_46_arg_0 = var_42; [L188] SORT_5 var_46 = ~var_46_arg_0; [L189] SORT_5 var_47_arg_0 = var_45; [L190] SORT_5 var_47_arg_1 = var_46; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_47_arg_0=1, var_47_arg_1=-2, var_60=0, var_81=0, var_90=1, var_99=2] [L191] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L191] SORT_5 var_47 = var_47_arg_0 & var_47_arg_1; [L192] EXPR var_47 & mask_SORT_5 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L192] var_47 = var_47 & mask_SORT_5 [L193] SORT_5 bad_48_arg_0 = var_47; [L194] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5548 SdHoareTripleChecker+Valid, 29.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5548 mSDsluCounter, 46156 SdHoareTripleChecker+Invalid, 28.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38075 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12764 IncrementalHoareTripleChecker+Invalid, 12796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 8081 mSDtfsCounter, 12764 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=28, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 651 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2404 NumberOfCodeBlocks, 2404 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2287 ConstructedInterpolants, 0 QuantifiedInterpolants, 7038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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-05 20:06:46,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.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 dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:06:48,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:06:48,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:06:48,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:06:48,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:06:48,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:06:48,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:06:48,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:06:48,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:06:48,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:06:48,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:06:48,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:06:48,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:06:48,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:06:48,841 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:06:48,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:06:48,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:06:48,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:06:48,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:06:48,843 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 -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2025-02-05 20:06:49,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:06:49,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:06:49,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:06:49,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:06:49,044 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:06:49,046 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.toy_lock_4.c [2025-02-05 20:06:50,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ceb10501/b89c6261e1dc433aa4c6858109411008/FLAG3705044ca [2025-02-05 20:06:50,461 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:06:50,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2025-02-05 20:06:50,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ceb10501/b89c6261e1dc433aa4c6858109411008/FLAG3705044ca [2025-02-05 20:06:50,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ceb10501/b89c6261e1dc433aa4c6858109411008 [2025-02-05 20:06:50,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:06:50,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:06:50,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:06:50,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:06:50,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:06:50,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:06:50" (1/1) ... [2025-02-05 20:06:50,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467efdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:50, skipping insertion in model container [2025-02-05 20:06:50,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:06:50" (1/1) ... [2025-02-05 20:06:50,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:06:50,937 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.toy_lock_4.c[1250,1263] [2025-02-05 20:06:51,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:06:51,070 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:06:51,077 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.toy_lock_4.c[1250,1263] [2025-02-05 20:06:51,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:06:51,152 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:06:51,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51 WrapperNode [2025-02-05 20:06:51,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:06:51,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:06:51,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:06:51,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:06:51,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,217 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 899 [2025-02-05 20:06:51,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:06:51,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:06:51,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:06:51,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:06:51,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,251 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-05 20:06:51,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:06:51,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:06:51,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:06:51,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:06:51,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (1/1) ... [2025-02-05 20:06:51,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:06:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:06:51,323 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-05 20:06:51,326 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-05 20:06:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:06:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:06:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:06:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:06:51,489 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:06:51,491 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:06:52,074 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-02-05 20:06:52,075 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:06:52,080 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:06:52,080 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:06:52,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:06:52 BoogieIcfgContainer [2025-02-05 20:06:52,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:06:52,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:06:52,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:06:52,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:06:52,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:06:50" (1/3) ... [2025-02-05 20:06:52,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21791853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:06:52, skipping insertion in model container [2025-02-05 20:06:52,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:06:51" (2/3) ... [2025-02-05 20:06:52,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21791853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:06:52, skipping insertion in model container [2025-02-05 20:06:52,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:06:52" (3/3) ... [2025-02-05 20:06:52,091 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2025-02-05 20:06:52,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:06:52,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.toy_lock_4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:06:52,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:06:52,144 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;@719b2d17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:06:52,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:06:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:06:52,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:52,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:06:52,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:06:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:06:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503342214] [2025-02-05 20:06:52,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:52,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:06:52,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:06:52,164 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-05 20:06:52,165 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-05 20:06:52,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:06:52,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:06:52,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:52,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:52,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-05 20:06:52,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:06:52,722 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-05 20:06:52,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:06:52,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:06:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503342214] [2025-02-05 20:06:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503342214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:06:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:06:52,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:06:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112024034] [2025-02-05 20:06:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:06:52,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:06:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:06:52,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:06:52,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:06:52,744 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:06:52,802 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:06:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:06:52,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 20:06:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:06:52,809 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:06:52,810 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:06:52,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:06:52,814 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:06:52,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:06:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:06:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:06:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:06:52,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:06:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:06:52,835 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:06:52,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:06:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:06:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:06:52,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:06:52,836 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:06:52,843 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-05 20:06:53,040 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-05 20:06:53,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:06:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:06:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:06:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:06:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740073487] [2025-02-05 20:06:53,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:06:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:06:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:06:53,044 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-05 20:06:53,044 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-05 20:06:53,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:06:53,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:06:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:06:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:06:53,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-05 20:06:53,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:06:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:06:54,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:07:00,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_11~0#1|))) (let ((.cse3 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_20~0#1|) .cse6)) (.cse4 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_15~0#1|) .cse6))) (let ((.cse0 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_12~0#1|) .cse6)) (.cse5 (not .cse4)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse2 (not .cse3))) (and (or .cse0 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))))))))))))))) .cse1)))) .cse2) (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|))))))))))))) .cse1)))))) .cse4) (or (and (or (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|)))) .cse1)) (_ bv0 8))) .cse2) (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|))))))))))))) .cse1)))))) .cse5))) (or (not .cse0) (and (or (and (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|))))))))))))))))))) .cse1))))) (or (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|))))))))))))))))))))) (_ bv0 8))) .cse2)) .cse5) (or .cse4 (and (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|))))))))))))) .cse1))))) (or (forall ((|v_ULTIMATE.start_main_~var_37_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_47_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_33_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_41_arg_1~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_47_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_37_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_1~0#1_10|)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_41_arg_1~0#1_10|))))))))))))) .cse1)))) .cse2))))))))) is different from false