./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.05.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:55:10,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:55:10,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:55:10,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:55:10,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:55:10,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:55:10,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:55:10,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:55:10,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:55:10,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:55:10,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:55:10,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:55:10,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:55:10,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:55:10,592 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:55:10,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:55:10,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:55:10,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:55:10,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:55:10,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:55:10,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:55:10,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:55:10,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:55:10,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:55:10,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:55:10,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:55:10,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:55:10,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f [2025-03-08 05:55:10,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:55:10,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:55:10,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:55:10,804 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:55:10,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:55:10,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.05.cil.c [2025-03-08 05:55:11,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4571e14d/8f1b5ba234964b12a73831a86dbc2a8a/FLAG98e334c1c [2025-03-08 05:55:12,205 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:55:12,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c [2025-03-08 05:55:12,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4571e14d/8f1b5ba234964b12a73831a86dbc2a8a/FLAG98e334c1c [2025-03-08 05:55:12,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4571e14d/8f1b5ba234964b12a73831a86dbc2a8a [2025-03-08 05:55:12,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:55:12,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:55:12,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:55:12,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:55:12,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:55:12,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12, skipping insertion in model container [2025-03-08 05:55:12,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:55:12,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c[706,719] [2025-03-08 05:55:12,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:55:12,464 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:55:12,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c[706,719] [2025-03-08 05:55:12,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:55:12,505 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:55:12,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12 WrapperNode [2025-03-08 05:55:12,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:55:12,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:55:12,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:55:12,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:55:12,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,538 INFO L138 Inliner]: procedures = 38, calls = 45, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 419 [2025-03-08 05:55:12,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:55:12,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:55:12,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:55:12,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:55:12,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:55:12,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:55:12,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:55:12,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:55:12,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:55:12,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (1/1) ... [2025-03-08 05:55:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:55:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:55:12,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:55:12,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:55:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:55:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:55:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:55:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:55:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:55:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:55:12,625 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:55:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:55:12,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:55:12,691 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:55:12,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:55:13,150 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-08 05:55:13,150 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:55:13,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:55:13,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:55:13,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:55:13 BoogieIcfgContainer [2025-03-08 05:55:13,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:55:13,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:55:13,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:55:13,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:55:13,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:55:12" (1/3) ... [2025-03-08 05:55:13,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36091222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:55:13, skipping insertion in model container [2025-03-08 05:55:13,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:12" (2/3) ... [2025-03-08 05:55:13,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36091222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:55:13, skipping insertion in model container [2025-03-08 05:55:13,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:55:13" (3/3) ... [2025-03-08 05:55:13,171 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2025-03-08 05:55:13,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:55:13,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.05.cil.c that has 7 procedures, 200 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-08 05:55:13,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:55:13,249 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;@65f02038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:55:13,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:55:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 175 states have (on average 1.5714285714285714) internal successors, (275), 176 states have internal predecessors, (275), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 05:55:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:13,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:13,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:13,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash 43685907, now seen corresponding path program 1 times [2025-03-08 05:55:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30189171] [2025-03-08 05:55:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:13,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:13,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:13,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:13,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30189171] [2025-03-08 05:55:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30189171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:13,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:13,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303791776] [2025-03-08 05:55:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:13,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:13,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:13,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:13,667 INFO L87 Difference]: Start difference. First operand has 200 states, 175 states have (on average 1.5714285714285714) internal successors, (275), 176 states have internal predecessors, (275), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:14,086 INFO L93 Difference]: Finished difference Result 590 states and 935 transitions. [2025-03-08 05:55:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:55:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:14,102 INFO L225 Difference]: With dead ends: 590 [2025-03-08 05:55:14,102 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 05:55:14,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:14,113 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 537 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:14,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 812 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 05:55:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 380. [2025-03-08 05:55:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 335 states have (on average 1.537313432835821) internal successors, (515), 337 states have internal predecessors, (515), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-08 05:55:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 578 transitions. [2025-03-08 05:55:14,172 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 578 transitions. Word has length 101 [2025-03-08 05:55:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:14,172 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 578 transitions. [2025-03-08 05:55:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 578 transitions. [2025-03-08 05:55:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:14,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:14,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:55:14,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:14,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash 931039414, now seen corresponding path program 1 times [2025-03-08 05:55:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-03-08 05:55:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:14,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:14,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:14,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-03-08 05:55:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357143043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264693] [2025-03-08 05:55:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:14,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:14,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:14,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:14,379 INFO L87 Difference]: Start difference. First operand 380 states and 578 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:14,606 INFO L93 Difference]: Finished difference Result 780 states and 1199 transitions. [2025-03-08 05:55:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:14,611 INFO L225 Difference]: With dead ends: 780 [2025-03-08 05:55:14,611 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 05:55:14,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:14,613 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 386 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:14,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 563 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 05:55:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 380. [2025-03-08 05:55:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 335 states have (on average 1.5313432835820895) internal successors, (513), 337 states have internal predecessors, (513), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-08 05:55:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 576 transitions. [2025-03-08 05:55:14,641 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 576 transitions. Word has length 101 [2025-03-08 05:55:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:14,642 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 576 transitions. [2025-03-08 05:55:14,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 576 transitions. [2025-03-08 05:55:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:14,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:14,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:14,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:55:14,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:14,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:14,647 INFO L85 PathProgramCache]: Analyzing trace with hash -278202825, now seen corresponding path program 1 times [2025-03-08 05:55:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-08 05:55:14,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:14,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:14,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:14,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-08 05:55:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445899137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288348] [2025-03-08 05:55:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:14,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:14,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:14,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:14,789 INFO L87 Difference]: Start difference. First operand 380 states and 576 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:15,291 INFO L93 Difference]: Finished difference Result 1016 states and 1550 transitions. [2025-03-08 05:55:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:15,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:15,296 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 05:55:15,296 INFO L226 Difference]: Without dead ends: 649 [2025-03-08 05:55:15,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:15,300 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 575 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:15,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1466 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-08 05:55:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 552. [2025-03-08 05:55:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 487 states have (on average 1.5215605749486654) internal successors, (741), 490 states have internal predecessors, (741), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 05:55:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 833 transitions. [2025-03-08 05:55:15,356 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 833 transitions. Word has length 101 [2025-03-08 05:55:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:15,356 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 833 transitions. [2025-03-08 05:55:15,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 833 transitions. [2025-03-08 05:55:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:15,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:15,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:15,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:55:15,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:15,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash 929715350, now seen corresponding path program 1 times [2025-03-08 05:55:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:15,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-08 05:55:15,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:15,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:15,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:15,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:15,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-08 05:55:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037370447] [2025-03-08 05:55:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:15,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:15,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:15,482 INFO L87 Difference]: Start difference. First operand 552 states and 833 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:16,009 INFO L93 Difference]: Finished difference Result 1554 states and 2364 transitions. [2025-03-08 05:55:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:16,016 INFO L225 Difference]: With dead ends: 1554 [2025-03-08 05:55:16,016 INFO L226 Difference]: Without dead ends: 1015 [2025-03-08 05:55:16,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:16,019 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 570 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:16,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1450 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-08 05:55:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 913. [2025-03-08 05:55:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 806 states have (on average 1.5186104218362282) internal successors, (1224), 813 states have internal predecessors, (1224), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-08 05:55:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1380 transitions. [2025-03-08 05:55:16,085 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1380 transitions. Word has length 101 [2025-03-08 05:55:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:16,086 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1380 transitions. [2025-03-08 05:55:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1380 transitions. [2025-03-08 05:55:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:16,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:16,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:16,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:55:16,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:16,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash -555340201, now seen corresponding path program 1 times [2025-03-08 05:55:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:16,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699042494] [2025-03-08 05:55:16,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:16,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:16,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:16,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699042494] [2025-03-08 05:55:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699042494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:16,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:16,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570191789] [2025-03-08 05:55:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:16,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:16,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:16,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:16,205 INFO L87 Difference]: Start difference. First operand 913 states and 1380 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:16,806 INFO L93 Difference]: Finished difference Result 2693 states and 4121 transitions. [2025-03-08 05:55:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:16,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:16,819 INFO L225 Difference]: With dead ends: 2693 [2025-03-08 05:55:16,819 INFO L226 Difference]: Without dead ends: 1793 [2025-03-08 05:55:16,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:16,822 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 565 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:16,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1438 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:55:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-08 05:55:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1680. [2025-03-08 05:55:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1483 states have (on average 1.523937963587323) internal successors, (2260), 1504 states have internal predecessors, (2260), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-08 05:55:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2568 transitions. [2025-03-08 05:55:16,901 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2568 transitions. Word has length 101 [2025-03-08 05:55:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2568 transitions. [2025-03-08 05:55:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2568 transitions. [2025-03-08 05:55:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:16,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:16,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:55:16,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 228038774, now seen corresponding path program 1 times [2025-03-08 05:55:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:16,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-03-08 05:55:16,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:16,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:16,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:16,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:16,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:16,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:16,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-03-08 05:55:16,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097997250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:16,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:16,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:16,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914574965] [2025-03-08 05:55:16,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:16,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:16,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:16,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:16,994 INFO L87 Difference]: Start difference. First operand 1680 states and 2568 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:17,582 INFO L93 Difference]: Finished difference Result 5132 states and 7999 transitions. [2025-03-08 05:55:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:17,596 INFO L225 Difference]: With dead ends: 5132 [2025-03-08 05:55:17,597 INFO L226 Difference]: Without dead ends: 3465 [2025-03-08 05:55:17,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:17,601 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 560 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:17,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1426 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2025-03-08 05:55:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3331. [2025-03-08 05:55:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 2936 states have (on average 1.5354223433242506) internal successors, (4508), 3003 states have internal predecessors, (4508), 226 states have call successors, (226), 102 states have call predecessors, (226), 168 states have return successors, (482), 241 states have call predecessors, (482), 226 states have call successors, (482) [2025-03-08 05:55:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 5216 transitions. [2025-03-08 05:55:17,728 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 5216 transitions. Word has length 101 [2025-03-08 05:55:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 5216 transitions. [2025-03-08 05:55:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 5216 transitions. [2025-03-08 05:55:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:17,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:17,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:17,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:55:17,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash -300880265, now seen corresponding path program 1 times [2025-03-08 05:55:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162852570] [2025-03-08 05:55:17,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:17,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:17,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:17,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:17,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:17,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162852570] [2025-03-08 05:55:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162852570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494086720] [2025-03-08 05:55:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:17,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:17,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:17,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:17,796 INFO L87 Difference]: Start difference. First operand 3331 states and 5216 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:18,088 INFO L93 Difference]: Finished difference Result 7147 states and 11450 transitions. [2025-03-08 05:55:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:18,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:18,107 INFO L225 Difference]: With dead ends: 7147 [2025-03-08 05:55:18,107 INFO L226 Difference]: Without dead ends: 3829 [2025-03-08 05:55:18,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:18,118 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 377 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:18,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 529 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2025-03-08 05:55:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3331. [2025-03-08 05:55:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 2936 states have (on average 1.529632152588556) internal successors, (4491), 3003 states have internal predecessors, (4491), 226 states have call successors, (226), 102 states have call predecessors, (226), 168 states have return successors, (482), 241 states have call predecessors, (482), 226 states have call successors, (482) [2025-03-08 05:55:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 5199 transitions. [2025-03-08 05:55:18,287 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 5199 transitions. Word has length 101 [2025-03-08 05:55:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:18,287 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 5199 transitions. [2025-03-08 05:55:18,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 5199 transitions. [2025-03-08 05:55:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:18,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:18,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:18,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:55:18,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash -872131498, now seen corresponding path program 1 times [2025-03-08 05:55:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055584839] [2025-03-08 05:55:18,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:18,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:18,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:18,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:18,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055584839] [2025-03-08 05:55:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055584839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:18,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619952727] [2025-03-08 05:55:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:18,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:18,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:18,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:18,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:18,397 INFO L87 Difference]: Start difference. First operand 3331 states and 5199 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:19,116 INFO L93 Difference]: Finished difference Result 10735 states and 17199 transitions. [2025-03-08 05:55:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:19,151 INFO L225 Difference]: With dead ends: 10735 [2025-03-08 05:55:19,152 INFO L226 Difference]: Without dead ends: 7417 [2025-03-08 05:55:19,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:19,163 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 651 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:19,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1377 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2025-03-08 05:55:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 6801. [2025-03-08 05:55:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6801 states, 5972 states have (on average 1.540689886135298) internal successors, (9201), 6185 states have internal predecessors, (9201), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-03-08 05:55:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 11061 transitions. [2025-03-08 05:55:19,482 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 11061 transitions. Word has length 101 [2025-03-08 05:55:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:19,483 INFO L471 AbstractCegarLoop]: Abstraction has 6801 states and 11061 transitions. [2025-03-08 05:55:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 11061 transitions. [2025-03-08 05:55:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:19,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:19,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:19,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:55:19,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:19,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash -752011625, now seen corresponding path program 1 times [2025-03-08 05:55:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244957731] [2025-03-08 05:55:19,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:19,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:19,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:19,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:19,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244957731] [2025-03-08 05:55:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244957731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269058921] [2025-03-08 05:55:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:19,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:19,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:19,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:19,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:19,565 INFO L87 Difference]: Start difference. First operand 6801 states and 11061 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:20,049 INFO L93 Difference]: Finished difference Result 14569 states and 24418 transitions. [2025-03-08 05:55:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:20,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:20,092 INFO L225 Difference]: With dead ends: 14569 [2025-03-08 05:55:20,092 INFO L226 Difference]: Without dead ends: 7781 [2025-03-08 05:55:20,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:20,112 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 373 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:20,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 515 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7781 states. [2025-03-08 05:55:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7781 to 6801. [2025-03-08 05:55:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6801 states, 5972 states have (on average 1.5351640991292699) internal successors, (9168), 6185 states have internal predecessors, (9168), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-03-08 05:55:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 11028 transitions. [2025-03-08 05:55:20,587 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 11028 transitions. Word has length 101 [2025-03-08 05:55:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:20,588 INFO L471 AbstractCegarLoop]: Abstraction has 6801 states and 11028 transitions. [2025-03-08 05:55:20,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 11028 transitions. [2025-03-08 05:55:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:20,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:20,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:20,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:55:20,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash -332494794, now seen corresponding path program 1 times [2025-03-08 05:55:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635456836] [2025-03-08 05:55:20,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:20,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:20,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:20,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:20,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635456836] [2025-03-08 05:55:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635456836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:20,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:20,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882022743] [2025-03-08 05:55:20,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:20,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:20,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:20,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:20,665 INFO L87 Difference]: Start difference. First operand 6801 states and 11028 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:21,160 INFO L93 Difference]: Finished difference Result 14324 states and 23862 transitions. [2025-03-08 05:55:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:21,204 INFO L225 Difference]: With dead ends: 14324 [2025-03-08 05:55:21,204 INFO L226 Difference]: Without dead ends: 7536 [2025-03-08 05:55:21,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:21,222 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 370 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:21,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 507 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-03-08 05:55:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 6801. [2025-03-08 05:55:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6801 states, 5972 states have (on average 1.5296383121232418) internal successors, (9135), 6185 states have internal predecessors, (9135), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-03-08 05:55:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 10995 transitions. [2025-03-08 05:55:21,639 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 10995 transitions. Word has length 101 [2025-03-08 05:55:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:21,640 INFO L471 AbstractCegarLoop]: Abstraction has 6801 states and 10995 transitions. [2025-03-08 05:55:21,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 10995 transitions. [2025-03-08 05:55:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:21,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:21,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:21,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:55:21,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash -318961993, now seen corresponding path program 1 times [2025-03-08 05:55:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:21,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790090664] [2025-03-08 05:55:21,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:21,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:21,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:21,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:21,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790090664] [2025-03-08 05:55:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790090664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:21,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:21,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280061960] [2025-03-08 05:55:21,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:21,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:21,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:21,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:21,733 INFO L87 Difference]: Start difference. First operand 6801 states and 10995 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:23,026 INFO L93 Difference]: Finished difference Result 20945 states and 35381 transitions. [2025-03-08 05:55:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:23,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:23,081 INFO L225 Difference]: With dead ends: 20945 [2025-03-08 05:55:23,081 INFO L226 Difference]: Without dead ends: 14157 [2025-03-08 05:55:23,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:23,097 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 540 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:23,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1327 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:55:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2025-03-08 05:55:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13774. [2025-03-08 05:55:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13774 states, 11931 states have (on average 1.5186488978291846) internal successors, (18119), 12598 states have internal predecessors, (18119), 786 states have call successors, (786), 390 states have call predecessors, (786), 1056 states have return successors, (4882), 849 states have call predecessors, (4882), 786 states have call successors, (4882) [2025-03-08 05:55:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13774 states to 13774 states and 23787 transitions. [2025-03-08 05:55:23,848 INFO L78 Accepts]: Start accepts. Automaton has 13774 states and 23787 transitions. Word has length 101 [2025-03-08 05:55:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:23,848 INFO L471 AbstractCegarLoop]: Abstraction has 13774 states and 23787 transitions. [2025-03-08 05:55:23,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 13774 states and 23787 transitions. [2025-03-08 05:55:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:23,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:23,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:55:23,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 789853206, now seen corresponding path program 1 times [2025-03-08 05:55:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322788495] [2025-03-08 05:55:23,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:23,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:23,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:23,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:23,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322788495] [2025-03-08 05:55:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322788495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187315092] [2025-03-08 05:55:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:23,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:23,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:23,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:23,922 INFO L87 Difference]: Start difference. First operand 13774 states and 23787 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:24,416 INFO L93 Difference]: Finished difference Result 27537 states and 47948 transitions. [2025-03-08 05:55:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:24,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:24,472 INFO L225 Difference]: With dead ends: 27537 [2025-03-08 05:55:24,473 INFO L226 Difference]: Without dead ends: 13777 [2025-03-08 05:55:24,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:24,502 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:24,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1150 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13777 states. [2025-03-08 05:55:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13777 to 13777. [2025-03-08 05:55:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 11934 states have (on average 1.5131556896262779) internal successors, (18058), 12601 states have internal predecessors, (18058), 786 states have call successors, (786), 390 states have call predecessors, (786), 1056 states have return successors, (4882), 849 states have call predecessors, (4882), 786 states have call successors, (4882) [2025-03-08 05:55:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 23726 transitions. [2025-03-08 05:55:25,463 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 23726 transitions. Word has length 101 [2025-03-08 05:55:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:25,463 INFO L471 AbstractCegarLoop]: Abstraction has 13777 states and 23726 transitions. [2025-03-08 05:55:25,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 23726 transitions. [2025-03-08 05:55:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:25,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:25,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:25,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:55:25,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 181776343, now seen corresponding path program 1 times [2025-03-08 05:55:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400216071] [2025-03-08 05:55:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:25,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:25,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:25,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:25,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:25,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400216071] [2025-03-08 05:55:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400216071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:25,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:55:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120257864] [2025-03-08 05:55:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:25,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:55:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:25,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:55:25,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:25,535 INFO L87 Difference]: Start difference. First operand 13777 states and 23726 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:26,737 INFO L93 Difference]: Finished difference Result 41073 states and 71100 transitions. [2025-03-08 05:55:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:26,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:26,854 INFO L225 Difference]: With dead ends: 41073 [2025-03-08 05:55:26,854 INFO L226 Difference]: Without dead ends: 27310 [2025-03-08 05:55:26,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:55:26,895 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 504 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:26,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1015 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:55:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27310 states. [2025-03-08 05:55:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27310 to 27242. [2025-03-08 05:55:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27242 states, 23594 states have (on average 1.507840976519454) internal successors, (35576), 24927 states have internal predecessors, (35576), 1535 states have call successors, (1535), 780 states have call predecessors, (1535), 2112 states have return successors, (9664), 1598 states have call predecessors, (9664), 1535 states have call successors, (9664) [2025-03-08 05:55:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27242 states to 27242 states and 46775 transitions. [2025-03-08 05:55:28,335 INFO L78 Accepts]: Start accepts. Automaton has 27242 states and 46775 transitions. Word has length 101 [2025-03-08 05:55:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 27242 states and 46775 transitions. [2025-03-08 05:55:28,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27242 states and 46775 transitions. [2025-03-08 05:55:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:28,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:28,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:55:28,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1540562970, now seen corresponding path program 1 times [2025-03-08 05:55:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697414924] [2025-03-08 05:55:28,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:28,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:28,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:28,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:28,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:28,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697414924] [2025-03-08 05:55:28,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697414924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:28,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004556306] [2025-03-08 05:55:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:28,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:28,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:28,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:28,405 INFO L87 Difference]: Start difference. First operand 27242 states and 46775 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:29,725 INFO L93 Difference]: Finished difference Result 54665 states and 94539 transitions. [2025-03-08 05:55:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:55:29,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:29,852 INFO L225 Difference]: With dead ends: 54665 [2025-03-08 05:55:29,853 INFO L226 Difference]: Without dead ends: 27437 [2025-03-08 05:55:29,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:29,925 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:29,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1150 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27437 states. [2025-03-08 05:55:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27437 to 27437. [2025-03-08 05:55:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27437 states, 23789 states have (on average 1.5009458152927824) internal successors, (35706), 25122 states have internal predecessors, (35706), 1535 states have call successors, (1535), 780 states have call predecessors, (1535), 2112 states have return successors, (9664), 1598 states have call predecessors, (9664), 1535 states have call successors, (9664) [2025-03-08 05:55:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27437 states to 27437 states and 46905 transitions. [2025-03-08 05:55:31,727 INFO L78 Accepts]: Start accepts. Automaton has 27437 states and 46905 transitions. Word has length 101 [2025-03-08 05:55:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:31,727 INFO L471 AbstractCegarLoop]: Abstraction has 27437 states and 46905 transitions. [2025-03-08 05:55:31,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27437 states and 46905 transitions. [2025-03-08 05:55:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:55:31,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:31,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:31,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:55:31,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:31,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 373866651, now seen corresponding path program 1 times [2025-03-08 05:55:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057899995] [2025-03-08 05:55:31,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:31,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:55:31,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:55:31,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:31,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057899995] [2025-03-08 05:55:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057899995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831059746] [2025-03-08 05:55:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:31,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:31,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:31,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:31,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:31,789 INFO L87 Difference]: Start difference. First operand 27437 states and 46905 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:37,907 INFO L93 Difference]: Finished difference Result 161150 states and 280953 transitions. [2025-03-08 05:55:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:55:37,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-08 05:55:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:38,634 INFO L225 Difference]: With dead ends: 161150 [2025-03-08 05:55:38,635 INFO L226 Difference]: Without dead ends: 133727 [2025-03-08 05:55:38,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:55:38,782 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1360 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:38,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1220 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:55:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133727 states.