./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-?-48c9605-m [2025-02-08 00:05:44,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:05:44,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:05:44,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:05:44,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:05:44,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:05:44,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:05:44,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:05:44,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:05:44,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:05:44,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:05:44,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:05:44,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:05:44,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:05:44,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:05:44,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:05:44,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:05:44,748 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-08 00:05:45,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:05:45,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:05:45,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:05:45,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:05:45,015 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:05:45,016 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-08 00:05:46,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e764b78d/f4124e36031642d785be5948eed52bdc/FLAG2cd8db7c9 [2025-02-08 00:05:46,496 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:05:46,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2025-02-08 00:05:46,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e764b78d/f4124e36031642d785be5948eed52bdc/FLAG2cd8db7c9 [2025-02-08 00:05:46,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e764b78d/f4124e36031642d785be5948eed52bdc [2025-02-08 00:05:46,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:05:46,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:05:46,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:05:46,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:05:46,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:05:46,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:46,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b3fe7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46, skipping insertion in model container [2025-02-08 00:05:46,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:46,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:05:46,701 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-08 00:05:46,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:05:46,871 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:05:46,878 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-08 00:05:46,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:05:46,968 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:05:46,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46 WrapperNode [2025-02-08 00:05:46,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:05:46,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:05:46,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:05:46,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:05:46,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:46,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,102 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1371 [2025-02-08 00:05:47,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:05:47,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:05:47,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:05:47,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:05:47,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:05:47,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:05:47,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:05:47,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:05:47,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:05:47,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (1/1) ... [2025-02-08 00:05:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:05:47,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:05:47,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:05:47,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:05:47,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:05:47,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:05:47,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:05:47,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:05:47,538 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:05:47,539 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:05:49,450 INFO L? ?]: Removed 946 outVars from TransFormulas that were not future-live. [2025-02-08 00:05:49,450 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:05:49,494 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:05:49,494 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:05:49,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:05:49 BoogieIcfgContainer [2025-02-08 00:05:49,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:05:49,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:05:49,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:05:49,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:05:49,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:05:46" (1/3) ... [2025-02-08 00:05:49,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b89a5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:05:49, skipping insertion in model container [2025-02-08 00:05:49,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:05:46" (2/3) ... [2025-02-08 00:05:49,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b89a5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:05:49, skipping insertion in model container [2025-02-08 00:05:49,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:05:49" (3/3) ... [2025-02-08 00:05:49,503 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2025-02-08 00:05:49,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:05:49,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.toy_lock_4.c that has 1 procedures, 244 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:05:49,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:05:49,564 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;@27a4aa7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:05:49,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:05:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 242 states have (on average 1.5) internal successors, (363), 243 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-08 00:05:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 00:05:49,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:49,575 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] [2025-02-08 00:05:49,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:49,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:49,581 INFO L85 PathProgramCache]: Analyzing trace with hash -727735540, now seen corresponding path program 1 times [2025-02-08 00:05:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:49,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526440443] [2025-02-08 00:05:49,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:49,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 00:05:49,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 00:05:49,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:49,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526440443] [2025-02-08 00:05:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526440443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:05:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193369431] [2025-02-08 00:05:50,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:50,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:05:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:05:50,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:50,336 INFO L87 Difference]: Start difference. First operand has 244 states, 242 states have (on average 1.5) internal successors, (363), 243 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) Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:50,526 INFO L93 Difference]: Finished difference Result 423 states and 631 transitions. [2025-02-08 00:05:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:05:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-08 00:05:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:50,539 INFO L225 Difference]: With dead ends: 423 [2025-02-08 00:05:50,540 INFO L226 Difference]: Without dead ends: 244 [2025-02-08 00:05:50,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:50,547 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 892 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:50,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 892 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:05:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-08 00:05:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-02-08 00:05:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2025-02-08 00:05:50,595 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 74 [2025-02-08 00:05:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:50,596 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2025-02-08 00:05:50,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2025-02-08 00:05:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 00:05:50,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:50,599 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-08 00:05:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:05:50,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1080285949, now seen corresponding path program 1 times [2025-02-08 00:05:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832223224] [2025-02-08 00:05:50,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:50,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 00:05:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 00:05:50,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:50,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832223224] [2025-02-08 00:05:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832223224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:05:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987005245] [2025-02-08 00:05:50,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:50,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:05:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:50,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:05:50,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:50,878 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. 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-08 00:05:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:51,050 INFO L93 Difference]: Finished difference Result 425 states and 630 transitions. [2025-02-08 00:05:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:05:51,050 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-08 00:05:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:51,051 INFO L225 Difference]: With dead ends: 425 [2025-02-08 00:05:51,051 INFO L226 Difference]: Without dead ends: 246 [2025-02-08 00:05:51,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:51,052 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 889 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:51,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:05:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-08 00:05:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-08 00:05:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 245 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 364 transitions. [2025-02-08 00:05:51,068 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 364 transitions. Word has length 75 [2025-02-08 00:05:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 364 transitions. [2025-02-08 00:05:51,069 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-08 00:05:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 364 transitions. [2025-02-08 00:05:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 00:05:51,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:51,070 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-08 00:05:51,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:05:51,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:51,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1492583961, now seen corresponding path program 1 times [2025-02-08 00:05:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263433341] [2025-02-08 00:05:51,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:51,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 00:05:51,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 00:05:51,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:51,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263433341] [2025-02-08 00:05:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263433341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:05:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457255378] [2025-02-08 00:05:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:05:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:51,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:05:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:05:51,430 INFO L87 Difference]: Start difference. First operand 246 states and 364 transitions. Second operand has 5 states, 5 states have (on average 15.2) 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-08 00:05:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:51,640 INFO L93 Difference]: Finished difference Result 431 states and 637 transitions. [2025-02-08 00:05:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:05:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) 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-08 00:05:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:51,642 INFO L225 Difference]: With dead ends: 431 [2025-02-08 00:05:51,643 INFO L226 Difference]: Without dead ends: 250 [2025-02-08 00:05:51,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-08 00:05:51,645 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 299 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:51,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 870 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:05:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-08 00:05:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2025-02-08 00:05:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4838709677419355) internal successors, (368), 248 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-08 00:05:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 368 transitions. [2025-02-08 00:05:51,656 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 368 transitions. Word has length 76 [2025-02-08 00:05:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 368 transitions. [2025-02-08 00:05:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) 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-08 00:05:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 368 transitions. [2025-02-08 00:05:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 00:05:51,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:51,657 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-08 00:05:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:05:51,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:51,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1432067160, now seen corresponding path program 1 times [2025-02-08 00:05:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924132300] [2025-02-08 00:05:51,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 00:05:51,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 00:05:51,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:51,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924132300] [2025-02-08 00:05:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924132300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:51,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:51,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:05:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179198868] [2025-02-08 00:05:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:05:51,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:51,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:05:51,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:05:51,915 INFO L87 Difference]: Start difference. First operand 249 states and 368 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-08 00:05:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:52,160 INFO L93 Difference]: Finished difference Result 439 states and 648 transitions. [2025-02-08 00:05:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:05:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-08 00:05:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:52,162 INFO L225 Difference]: With dead ends: 439 [2025-02-08 00:05:52,163 INFO L226 Difference]: Without dead ends: 255 [2025-02-08 00:05:52,164 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-08 00:05:52,165 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 4 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:52,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1475 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:05:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-08 00:05:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-08 00:05:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4803149606299213) internal successors, (376), 254 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-08 00:05:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 376 transitions. [2025-02-08 00:05:52,179 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 376 transitions. Word has length 77 [2025-02-08 00:05:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:52,180 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 376 transitions. [2025-02-08 00:05:52,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-08 00:05:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 376 transitions. [2025-02-08 00:05:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 00:05:52,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:52,181 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-08 00:05:52,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:05:52,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1793163981, now seen corresponding path program 1 times [2025-02-08 00:05:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:52,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15901607] [2025-02-08 00:05:52,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:52,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 00:05:52,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 00:05:52,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:52,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:53,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15901607] [2025-02-08 00:05:53,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15901607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:53,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:05:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719042559] [2025-02-08 00:05:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:53,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:05:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:53,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:05:53,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:05:53,089 INFO L87 Difference]: Start difference. First operand 255 states and 376 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08 00:05:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:54,405 INFO L93 Difference]: Finished difference Result 551 states and 808 transitions. [2025-02-08 00:05:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:05:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08 00:05:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:54,407 INFO L225 Difference]: With dead ends: 551 [2025-02-08 00:05:54,408 INFO L226 Difference]: Without dead ends: 361 [2025-02-08 00:05:54,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:05:54,409 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 127 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:54,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1591 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:05:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-08 00:05:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 287. [2025-02-08 00:05:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4825174825174825) internal successors, (424), 286 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-08 00:05:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 424 transitions. [2025-02-08 00:05:54,425 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 424 transitions. Word has length 77 [2025-02-08 00:05:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:54,425 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 424 transitions. [2025-02-08 00:05:54,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08 00:05:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 424 transitions. [2025-02-08 00:05:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 00:05:54,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:54,427 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-08 00:05:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:05:54,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:54,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1845297668, now seen corresponding path program 1 times [2025-02-08 00:05:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598225400] [2025-02-08 00:05:54,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:54,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 00:05:54,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 00:05:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598225400] [2025-02-08 00:05:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598225400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:05:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915712945] [2025-02-08 00:05:55,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:05:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:55,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:05:55,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:05:55,264 INFO L87 Difference]: Start difference. First operand 287 states and 424 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-08 00:05:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:57,610 INFO L93 Difference]: Finished difference Result 552 states and 808 transitions. [2025-02-08 00:05:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:05:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-08 00:05:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:57,612 INFO L225 Difference]: With dead ends: 552 [2025-02-08 00:05:57,612 INFO L226 Difference]: Without dead ends: 360 [2025-02-08 00:05:57,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:05:57,613 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 123 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:57,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1720 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 00:05:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-08 00:05:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 293. [2025-02-08 00:05:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4691780821917808) internal successors, (429), 292 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 429 transitions. [2025-02-08 00:05:57,631 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 429 transitions. Word has length 78 [2025-02-08 00:05:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:57,631 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 429 transitions. [2025-02-08 00:05:57,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-08 00:05:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 429 transitions. [2025-02-08 00:05:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 00:05:57,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:57,632 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-08 00:05:57,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:05:57,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:57,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 356051962, now seen corresponding path program 1 times [2025-02-08 00:05:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739017433] [2025-02-08 00:05:57,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:57,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 00:05:57,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 00:05:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739017433] [2025-02-08 00:05:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739017433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:05:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141643699] [2025-02-08 00:05:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:58,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:05:58,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:58,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:05:58,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:58,245 INFO L87 Difference]: Start difference. First operand 293 states and 429 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:05:58,416 INFO L93 Difference]: Finished difference Result 482 states and 707 transitions. [2025-02-08 00:05:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:05:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 00:05:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:05:58,418 INFO L225 Difference]: With dead ends: 482 [2025-02-08 00:05:58,418 INFO L226 Difference]: Without dead ends: 286 [2025-02-08 00:05:58,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:58,420 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:05:58,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:05:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-08 00:05:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-02-08 00:05:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.4701754385964911) internal successors, (419), 285 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2025-02-08 00:05:58,432 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 79 [2025-02-08 00:05:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:05:58,432 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2025-02-08 00:05:58,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:05:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2025-02-08 00:05:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 00:05:58,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:05:58,435 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-08 00:05:58,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:05:58,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:05:58,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:05:58,436 INFO L85 PathProgramCache]: Analyzing trace with hash 176738231, now seen corresponding path program 1 times [2025-02-08 00:05:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:05:58,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614412810] [2025-02-08 00:05:58,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:05:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:05:58,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 00:05:58,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 00:05:58,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:05:58,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:05:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:05:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:05:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614412810] [2025-02-08 00:05:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614412810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:05:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:05:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:05:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519974499] [2025-02-08 00:05:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:05:58,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:05:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:05:58,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:05:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:05:58,964 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:00,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:01,200 INFO L93 Difference]: Finished difference Result 541 states and 788 transitions. [2025-02-08 00:06:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:06:01,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 00:06:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:01,202 INFO L225 Difference]: With dead ends: 541 [2025-02-08 00:06:01,202 INFO L226 Difference]: Without dead ends: 350 [2025-02-08 00:06:01,203 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-08 00:06:01,203 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 103 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:01,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 864 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 00:06:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-08 00:06:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 286. [2025-02-08 00:06:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.4666666666666666) internal successors, (418), 285 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 418 transitions. [2025-02-08 00:06:01,219 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 418 transitions. Word has length 79 [2025-02-08 00:06:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:01,220 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 418 transitions. [2025-02-08 00:06:01,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 418 transitions. [2025-02-08 00:06:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 00:06:01,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:01,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:01,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:06:01,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1705209855, now seen corresponding path program 1 times [2025-02-08 00:06:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:01,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419390793] [2025-02-08 00:06:01,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 00:06:01,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 00:06:01,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:01,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:01,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:01,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419390793] [2025-02-08 00:06:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419390793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:01,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:06:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84438544] [2025-02-08 00:06:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:06:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:01,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:06:01,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:06:01,732 INFO L87 Difference]: Start difference. First operand 286 states and 418 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:03,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:04,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:04,651 INFO L93 Difference]: Finished difference Result 547 states and 797 transitions. [2025-02-08 00:06:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:06:04,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-08 00:06:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:04,653 INFO L225 Difference]: With dead ends: 547 [2025-02-08 00:06:04,653 INFO L226 Difference]: Without dead ends: 358 [2025-02-08 00:06:04,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:06:04,656 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 111 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:04,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1965 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 00:06:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-08 00:06:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 292. [2025-02-08 00:06:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4673539518900343) internal successors, (427), 291 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 427 transitions. [2025-02-08 00:06:04,671 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 427 transitions. Word has length 80 [2025-02-08 00:06:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 427 transitions. [2025-02-08 00:06:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 427 transitions. [2025-02-08 00:06:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 00:06:04,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:04,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:06:04,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1672036188, now seen corresponding path program 1 times [2025-02-08 00:06:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:04,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077800760] [2025-02-08 00:06:04,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:04,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 00:06:04,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 00:06:04,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:04,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077800760] [2025-02-08 00:06:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077800760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:06:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927596749] [2025-02-08 00:06:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:06:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:05,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:06:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:06:05,026 INFO L87 Difference]: Start difference. First operand 292 states and 427 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:06,194 INFO L93 Difference]: Finished difference Result 547 states and 796 transitions. [2025-02-08 00:06:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:06:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-08 00:06:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:06,197 INFO L225 Difference]: With dead ends: 547 [2025-02-08 00:06:06,197 INFO L226 Difference]: Without dead ends: 356 [2025-02-08 00:06:06,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:06:06,198 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 97 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:06,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1428 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:06:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-08 00:06:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 298. [2025-02-08 00:06:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4545454545454546) internal successors, (432), 297 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 432 transitions. [2025-02-08 00:06:06,219 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 432 transitions. Word has length 81 [2025-02-08 00:06:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:06,219 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 432 transitions. [2025-02-08 00:06:06,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 432 transitions. [2025-02-08 00:06:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 00:06:06,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:06,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:06:06,221 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:06,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 984615633, now seen corresponding path program 1 times [2025-02-08 00:06:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:06,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057496305] [2025-02-08 00:06:06,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:06,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 00:06:06,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 00:06:06,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:06,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:06,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057496305] [2025-02-08 00:06:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057496305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:06,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:06:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655140357] [2025-02-08 00:06:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:06:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:06:06,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:06:06,755 INFO L87 Difference]: Start difference. First operand 298 states and 432 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-08 00:06:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:07,029 INFO L93 Difference]: Finished difference Result 493 states and 718 transitions. [2025-02-08 00:06:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:06:07,029 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-08 00:06:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:07,030 INFO L225 Difference]: With dead ends: 493 [2025-02-08 00:06:07,030 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 00:06:07,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-08 00:06:07,031 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 1 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:07,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2018 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:06:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 00:06:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 00:06:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4545454545454546) internal successors, (432), 297 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 432 transitions. [2025-02-08 00:06:07,037 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 432 transitions. Word has length 81 [2025-02-08 00:06:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:07,038 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 432 transitions. [2025-02-08 00:06:07,038 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-08 00:06:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 432 transitions. [2025-02-08 00:06:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 00:06:07,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:07,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:07,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:06:07,039 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -791407676, now seen corresponding path program 1 times [2025-02-08 00:06:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31516726] [2025-02-08 00:06:07,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:07,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:07,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 00:06:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 00:06:07,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:07,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31516726] [2025-02-08 00:06:07,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31516726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:07,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:07,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:06:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147400815] [2025-02-08 00:06:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:07,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:06:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:07,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:06:07,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:06:07,540 INFO L87 Difference]: Start difference. First operand 298 states and 432 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-08 00:06:10,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:10,965 INFO L93 Difference]: Finished difference Result 565 states and 819 transitions. [2025-02-08 00:06:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:06:10,965 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-08 00:06:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:10,967 INFO L225 Difference]: With dead ends: 565 [2025-02-08 00:06:10,967 INFO L226 Difference]: Without dead ends: 370 [2025-02-08 00:06:10,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:06:10,968 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 111 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:10,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1773 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-08 00:06:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-08 00:06:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 303. [2025-02-08 00:06:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4536423841059603) internal successors, (439), 302 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 439 transitions. [2025-02-08 00:06:10,978 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 439 transitions. Word has length 82 [2025-02-08 00:06:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:10,978 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 439 transitions. [2025-02-08 00:06:10,978 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-08 00:06:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 439 transitions. [2025-02-08 00:06:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:06:10,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:10,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:10,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:06:10,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1871753855, now seen corresponding path program 1 times [2025-02-08 00:06:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459112377] [2025-02-08 00:06:10,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:11,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:06:11,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:06:11,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459112377] [2025-02-08 00:06:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459112377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:06:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977829289] [2025-02-08 00:06:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:06:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:11,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:06:11,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:06:11,388 INFO L87 Difference]: Start difference. First operand 303 states and 439 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:13,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:14,116 INFO L93 Difference]: Finished difference Result 562 states and 814 transitions. [2025-02-08 00:06:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:06:14,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 00:06:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:14,118 INFO L225 Difference]: With dead ends: 562 [2025-02-08 00:06:14,118 INFO L226 Difference]: Without dead ends: 365 [2025-02-08 00:06:14,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:06:14,120 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 96 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:14,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1431 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 00:06:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-08 00:06:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 307. [2025-02-08 00:06:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4477124183006536) internal successors, (443), 306 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-08 00:06:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 443 transitions. [2025-02-08 00:06:14,129 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 443 transitions. Word has length 83 [2025-02-08 00:06:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:14,129 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 443 transitions. [2025-02-08 00:06:14,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 443 transitions. [2025-02-08 00:06:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:06:14,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:14,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:14,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:06:14,131 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:14,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1681216060, now seen corresponding path program 1 times [2025-02-08 00:06:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145569407] [2025-02-08 00:06:14,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:14,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:06:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:06:14,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:14,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145569407] [2025-02-08 00:06:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145569407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:14,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:06:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099323494] [2025-02-08 00:06:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:06:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:14,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:06:14,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:06:14,464 INFO L87 Difference]: Start difference. First operand 307 states and 443 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:14,680 INFO L93 Difference]: Finished difference Result 512 states and 742 transitions. [2025-02-08 00:06:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:06:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 00:06:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:14,682 INFO L225 Difference]: With dead ends: 512 [2025-02-08 00:06:14,682 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 00:06:14,683 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-08 00:06:14,683 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 7 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:14,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1459 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:06:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 00:06:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2025-02-08 00:06:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4455128205128205) internal successors, (451), 312 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 451 transitions. [2025-02-08 00:06:14,691 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 451 transitions. Word has length 83 [2025-02-08 00:06:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:14,691 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 451 transitions. [2025-02-08 00:06:14,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 451 transitions. [2025-02-08 00:06:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 00:06:14,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:14,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:14,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:06:14,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:14,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash -60500944, now seen corresponding path program 1 times [2025-02-08 00:06:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:14,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778512230] [2025-02-08 00:06:14,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 00:06:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 00:06:14,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:14,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778512230] [2025-02-08 00:06:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778512230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:06:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855662561] [2025-02-08 00:06:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:15,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:06:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:15,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:06:15,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:06:15,439 INFO L87 Difference]: Start difference. First operand 313 states and 451 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:15,914 INFO L93 Difference]: Finished difference Result 524 states and 760 transitions. [2025-02-08 00:06:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:06:15,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 00:06:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:15,915 INFO L225 Difference]: With dead ends: 524 [2025-02-08 00:06:15,916 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 00:06:15,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:06:15,917 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 3 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:15,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3129 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:06:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 00:06:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2025-02-08 00:06:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4493670886075949) internal successors, (458), 316 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-08 00:06:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 458 transitions. [2025-02-08 00:06:15,923 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 458 transitions. Word has length 83 [2025-02-08 00:06:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:15,923 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 458 transitions. [2025-02-08 00:06:15,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 458 transitions. [2025-02-08 00:06:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 00:06:15,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:15,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:15,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:06:15,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1765137929, now seen corresponding path program 1 times [2025-02-08 00:06:15,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:15,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091646030] [2025-02-08 00:06:15,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:15,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 00:06:15,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 00:06:15,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:15,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:16,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091646030] [2025-02-08 00:06:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091646030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:06:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918994237] [2025-02-08 00:06:16,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:16,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:06:16,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:16,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:06:16,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:06:16,371 INFO L87 Difference]: Start difference. First operand 317 states and 458 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-08 00:06:17,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:18,048 INFO L93 Difference]: Finished difference Result 593 states and 857 transitions. [2025-02-08 00:06:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:06:18,049 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-08 00:06:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:18,050 INFO L225 Difference]: With dead ends: 593 [2025-02-08 00:06:18,050 INFO L226 Difference]: Without dead ends: 383 [2025-02-08 00:06:18,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:06:18,051 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 99 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:18,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1965 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 00:06:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-08 00:06:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 325. [2025-02-08 00:06:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 324 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2025-02-08 00:06:18,056 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 84 [2025-02-08 00:06:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:18,056 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2025-02-08 00:06:18,057 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-08 00:06:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2025-02-08 00:06:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:06:18,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:18,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:06:18,058 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1363141887, now seen corresponding path program 1 times [2025-02-08 00:06:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927740445] [2025-02-08 00:06:18,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:18,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:06:18,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:06:18,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:18,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927740445] [2025-02-08 00:06:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927740445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:18,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-08 00:06:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590837665] [2025-02-08 00:06:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:18,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 00:06:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:18,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 00:06:18,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:06:18,726 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:20,154 INFO L93 Difference]: Finished difference Result 590 states and 858 transitions. [2025-02-08 00:06:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 00:06:20,155 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-08 00:06:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:20,156 INFO L225 Difference]: With dead ends: 590 [2025-02-08 00:06:20,156 INFO L226 Difference]: Without dead ends: 380 [2025-02-08 00:06:20,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:06:20,158 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 3819 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 4012 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:20,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 4012 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3597 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:06:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-08 00:06:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2025-02-08 00:06:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.4509283819628647) internal successors, (547), 377 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-08 00:06:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 547 transitions. [2025-02-08 00:06:20,165 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 547 transitions. Word has length 85 [2025-02-08 00:06:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:20,165 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 547 transitions. [2025-02-08 00:06:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 547 transitions. [2025-02-08 00:06:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:06:20,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:20,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:06:20,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1862089254, now seen corresponding path program 1 times [2025-02-08 00:06:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216278061] [2025-02-08 00:06:20,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:20,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:06:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:06:20,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:20,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:20,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-08 00:06:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216278061] [2025-02-08 00:06:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216278061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:06:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499450266] [2025-02-08 00:06:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:20,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:06:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:20,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:06:20,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:06:20,581 INFO L87 Difference]: Start difference. First operand 378 states and 547 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:22,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:23,175 INFO L93 Difference]: Finished difference Result 702 states and 1015 transitions. [2025-02-08 00:06:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:06:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-08 00:06:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:23,178 INFO L225 Difference]: With dead ends: 702 [2025-02-08 00:06:23,178 INFO L226 Difference]: Without dead ends: 437 [2025-02-08 00:06:23,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:06:23,179 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 85 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:23,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1428 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-08 00:06:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-08 00:06:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 384. [2025-02-08 00:06:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.441253263707572) internal successors, (552), 383 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 552 transitions. [2025-02-08 00:06:23,188 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 552 transitions. Word has length 85 [2025-02-08 00:06:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:23,188 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 552 transitions. [2025-02-08 00:06:23,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 552 transitions. [2025-02-08 00:06:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 00:06:23,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:23,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:23,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:06:23,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:23,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash -692253036, now seen corresponding path program 1 times [2025-02-08 00:06:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664479111] [2025-02-08 00:06:23,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:23,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 00:06:23,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 00:06:23,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:23,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664479111] [2025-02-08 00:06:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664479111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 00:06:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013853536] [2025-02-08 00:06:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:06:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:06:23,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:06:23,739 INFO L87 Difference]: Start difference. First operand 384 states and 552 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:24,193 INFO L93 Difference]: Finished difference Result 668 states and 968 transitions. [2025-02-08 00:06:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 00:06:24,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-08 00:06:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:24,194 INFO L225 Difference]: With dead ends: 668 [2025-02-08 00:06:24,194 INFO L226 Difference]: Without dead ends: 399 [2025-02-08 00:06:24,195 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-08 00:06:24,195 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 9 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:24,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3409 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:06:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-08 00:06:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2025-02-08 00:06:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4444444444444444) internal successors, (572), 396 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 572 transitions. [2025-02-08 00:06:24,202 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 572 transitions. Word has length 85 [2025-02-08 00:06:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:24,202 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 572 transitions. [2025-02-08 00:06:24,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 572 transitions. [2025-02-08 00:06:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 00:06:24,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:24,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:24,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:06:24,203 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 514920142, now seen corresponding path program 1 times [2025-02-08 00:06:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694860456] [2025-02-08 00:06:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:24,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 00:06:24,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 00:06:24,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:24,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694860456] [2025-02-08 00:06:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694860456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:06:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747126915] [2025-02-08 00:06:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:24,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:06:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:24,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:06:24,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:06:24,667 INFO L87 Difference]: Start difference. First operand 397 states and 572 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:28,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:28,511 INFO L93 Difference]: Finished difference Result 740 states and 1070 transitions. [2025-02-08 00:06:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:06:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-08 00:06:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:28,513 INFO L225 Difference]: With dead ends: 740 [2025-02-08 00:06:28,513 INFO L226 Difference]: Without dead ends: 458 [2025-02-08 00:06:28,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:06:28,514 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 100 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:28,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1591 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-08 00:06:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-08 00:06:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 403. [2025-02-08 00:06:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.445273631840796) internal successors, (581), 402 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 581 transitions. [2025-02-08 00:06:28,522 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 581 transitions. Word has length 86 [2025-02-08 00:06:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:28,522 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 581 transitions. [2025-02-08 00:06:28,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 581 transitions. [2025-02-08 00:06:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:06:28,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:28,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:28,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:06:28,524 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:28,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1890729745, now seen corresponding path program 1 times [2025-02-08 00:06:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:28,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147325243] [2025-02-08 00:06:28,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:28,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:06:28,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:06:28,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:28,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:29,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-08 00:06:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147325243] [2025-02-08 00:06:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147325243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-08 00:06:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612745248] [2025-02-08 00:06:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 00:06:29,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:29,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 00:06:29,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:06:29,299 INFO L87 Difference]: Start difference. First operand 403 states and 581 transitions. Second operand has 22 states, 22 states have (on average 3.9545454545454546) 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-08 00:06:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:30,432 INFO L93 Difference]: Finished difference Result 683 states and 992 transitions. [2025-02-08 00:06:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 00:06:30,433 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.9545454545454546) 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-08 00:06:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:30,434 INFO L225 Difference]: With dead ends: 683 [2025-02-08 00:06:30,434 INFO L226 Difference]: Without dead ends: 401 [2025-02-08 00:06:30,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 00:06:30,435 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 394 mSDsluCounter, 4918 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:30,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 5179 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:06:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-08 00:06:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 397. [2025-02-08 00:06:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.446969696969697) internal successors, (573), 396 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 573 transitions. [2025-02-08 00:06:30,441 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 573 transitions. Word has length 87 [2025-02-08 00:06:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:30,442 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 573 transitions. [2025-02-08 00:06:30,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) 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-08 00:06:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 573 transitions. [2025-02-08 00:06:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:06:30,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:30,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:30,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:06:30,443 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:30,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1596635829, now seen corresponding path program 1 times [2025-02-08 00:06:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719700726] [2025-02-08 00:06:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:30,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:06:30,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:06:30,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:30,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:30,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719700726] [2025-02-08 00:06:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719700726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:30,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:06:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281803169] [2025-02-08 00:06:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:30,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:06:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:30,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:06:30,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:06:30,723 INFO L87 Difference]: Start difference. First operand 397 states and 573 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:33,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 00:06:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:33,662 INFO L93 Difference]: Finished difference Result 722 states and 1045 transitions. [2025-02-08 00:06:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:06:33,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-08 00:06:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:33,664 INFO L225 Difference]: With dead ends: 722 [2025-02-08 00:06:33,664 INFO L226 Difference]: Without dead ends: 444 [2025-02-08 00:06:33,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:06:33,666 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 84 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:33,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1428 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 00:06:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-08 00:06:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 401. [2025-02-08 00:06:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.44) internal successors, (576), 400 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 576 transitions. [2025-02-08 00:06:33,671 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 576 transitions. Word has length 87 [2025-02-08 00:06:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:33,671 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 576 transitions. [2025-02-08 00:06:33,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 576 transitions. [2025-02-08 00:06:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 00:06:33,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:33,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:33,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:06:33,672 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1028877684, now seen corresponding path program 1 times [2025-02-08 00:06:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:33,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006617055] [2025-02-08 00:06:33,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:33,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 00:06:33,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 00:06:33,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:33,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:34,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:06:34,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006617055] [2025-02-08 00:06:34,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006617055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:34,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:34,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 00:06:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401742537] [2025-02-08 00:06:34,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:34,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 00:06:34,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:06:34,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 00:06:34,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:06:34,343 INFO L87 Difference]: Start difference. First operand 401 states and 576 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:34,900 INFO L93 Difference]: Finished difference Result 680 states and 986 transitions. [2025-02-08 00:06:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 00:06:34,901 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-08 00:06:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:34,902 INFO L225 Difference]: With dead ends: 680 [2025-02-08 00:06:34,902 INFO L226 Difference]: Without dead ends: 400 [2025-02-08 00:06:34,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:06:34,903 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 12 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4364 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:34,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4364 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:06:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-08 00:06:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-08 00:06:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.4385964912280702) internal successors, (574), 399 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 574 transitions. [2025-02-08 00:06:34,912 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 574 transitions. Word has length 87 [2025-02-08 00:06:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:34,912 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 574 transitions. [2025-02-08 00:06:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 574 transitions. [2025-02-08 00:06:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 00:06:34,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:34,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:06:34,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:06:34,913 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash -821172717, now seen corresponding path program 1 times [2025-02-08 00:06:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:06:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157492536] [2025-02-08 00:06:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:06:34,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:06:34,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:06:34,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:34,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:06:34,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:06:34,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 00:06:35,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 00:06:35,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:35,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:06:35,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:06:35,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:06:35,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:06:35,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:06:35,082 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] [2025-02-08 00:06:35,139 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:06:35,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:06:35,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:06:35 BoogieIcfgContainer [2025-02-08 00:06:35,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:06:35,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:06:35,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:06:35,164 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:06:35,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:05:49" (3/4) ... [2025-02-08 00:06:35,166 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:06:35,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:06:35,168 INFO L158 Benchmark]: Toolchain (without parser) took 48633.84ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 121.9MB in the beginning and 387.0MB in the end (delta: -265.1MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,168 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:06:35,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.03ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 85.1MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.74ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 57.8MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,169 INFO L158 Benchmark]: Boogie Preprocessor took 164.31ms. Allocated memory is still 167.8MB. Free memory was 57.8MB in the beginning and 39.1MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,169 INFO L158 Benchmark]: IcfgBuilder took 2225.86ms. Allocated memory is still 167.8MB. Free memory was 39.1MB in the beginning and 81.7MB in the end (delta: -42.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,169 INFO L158 Benchmark]: TraceAbstraction took 45664.70ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 80.7MB in the beginning and 387.0MB in the end (delta: -306.3MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,170 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 553.6MB. Free memory was 387.0MB in the beginning and 387.0MB in the end (delta: 48.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:06:35,170 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.98ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.03ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 85.1MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.74ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 57.8MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.31ms. Allocated memory is still 167.8MB. Free memory was 57.8MB in the beginning and 39.1MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2225.86ms. Allocated memory is still 167.8MB. Free memory was 39.1MB in the beginning and 81.7MB in the end (delta: -42.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 45664.70ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 80.7MB in the beginning and 387.0MB in the end (delta: -306.3MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 553.6MB. Free memory was 387.0MB in the beginning and 387.0MB in the end (delta: 48.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 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, 244 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.5s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2222 SdHoareTripleChecker+Valid, 31.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2222 mSDsluCounter, 45765 SdHoareTripleChecker+Invalid, 30.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39241 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15464 IncrementalHoareTripleChecker+Invalid, 15514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 6524 mSDtfsCounter, 15464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=20, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 677 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1962 NumberOfCodeBlocks, 1962 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1851 ConstructedInterpolants, 0 QuantifiedInterpolants, 5370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:06:35,198 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-?-48c9605-m [2025-02-08 00:06:37,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:06:37,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:06:37,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:06:37,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:06:37,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:06:37,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:06:37,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:06:37,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:06:37,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:06:37,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:06:37,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:06:37,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:06:37,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:06:37,585 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:06:37,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:06:37,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:06:37,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:06:37,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:06:37,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:06:37,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:06:37,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:06:37,587 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:06:37,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:06:37,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:06:37,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:06:37,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:06:37,588 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-08 00:06:37,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:06:37,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:06:37,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:06:37,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:06:37,857 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:06:37,858 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-08 00:06:39,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8ac99755/e3933366a4da447684da8e4ddb3a9154/FLAGf7e61ad19 [2025-02-08 00:06:39,463 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:06:39,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2025-02-08 00:06:39,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8ac99755/e3933366a4da447684da8e4ddb3a9154/FLAGf7e61ad19 [2025-02-08 00:06:39,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8ac99755/e3933366a4da447684da8e4ddb3a9154 [2025-02-08 00:06:39,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:06:39,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:06:39,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:06:39,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:06:39,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:06:39,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:39,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45431fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39, skipping insertion in model container [2025-02-08 00:06:39,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:39,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:06:39,694 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-08 00:06:39,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:06:39,851 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:06:39,859 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-08 00:06:39,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:06:39,956 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:06:39,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39 WrapperNode [2025-02-08 00:06:39,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:06:39,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:06:39,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:06:39,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:06:39,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:39,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,038 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 899 [2025-02-08 00:06:40,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:06:40,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:06:40,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:06:40,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:06:40,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:06:40,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:06:40,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:06:40,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:06:40,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:06:40,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (1/1) ... [2025-02-08 00:06:40,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:06:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:06:40,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:06:40,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:06:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:06:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:06:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:06:40,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:06:40,484 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:06:40,486 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:06:41,254 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-08 00:06:41,254 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:06:41,264 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:06:41,265 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:06:41,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:06:41 BoogieIcfgContainer [2025-02-08 00:06:41,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:06:41,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:06:41,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:06:41,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:06:41,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:06:39" (1/3) ... [2025-02-08 00:06:41,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201550d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:06:41, skipping insertion in model container [2025-02-08 00:06:41,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:06:39" (2/3) ... [2025-02-08 00:06:41,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201550d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:06:41, skipping insertion in model container [2025-02-08 00:06:41,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:06:41" (3/3) ... [2025-02-08 00:06:41,279 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2025-02-08 00:06:41,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:06:41,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.toy_lock_4.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:06:41,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:06:41,356 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;@1278c701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:06:41,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:06:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:06:41,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:41,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:06:41,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:06:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:06:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455481171] [2025-02-08 00:06:41,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:41,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:06:41,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:06:41,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:06:41,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:06:41,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:06:41,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:06:41,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:41,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:41,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 00:06:41,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:06:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:06:42,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:06:42,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:06:42,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455481171] [2025-02-08 00:06:42,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455481171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:06:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:06:42,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:06:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663014741] [2025-02-08 00:06:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:06:42,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:06:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:06:42,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:06:42,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:06:42,044 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:06:42,115 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:06:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:06:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:06:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:06:42,123 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:06:42,123 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:06:42,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:06:42,128 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:06:42,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:06:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:06:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:06:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:06:42,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:06:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:06:42,153 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:06:42,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:06:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:06:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:06:42,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:06:42,154 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:06:42,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:06:42,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:06:42,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:06:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:06:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:06:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:06:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879726982] [2025-02-08 00:06:42,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:06:42,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:06:42,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:06:42,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:06:42,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:06:42,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:06:42,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:06:42,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:06:42,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:06:42,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-08 00:06:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:06:43,881 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-08 00:06:43,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:06:50,379 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