./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.cil-2.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/token_ring.06.cil-2.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 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:54:00,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:54:00,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:54:00,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:54:00,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:54:00,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:54:00,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:54:00,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:54:00,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:54:00,219 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:54:00,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:54:00,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:54:00,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:54:00,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:54:00,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:54:00,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:54:00,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:54:00,221 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2025-03-08 05:54:00,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:54:00,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:54:00,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:54:00,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:54:00,458 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:54:00,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-03-08 05:54:01,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f0e9cae/435ce18ae2b7448ab48818993371961e/FLAGc7a97ae42 [2025-03-08 05:54:01,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:54:01,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-03-08 05:54:01,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f0e9cae/435ce18ae2b7448ab48818993371961e/FLAGc7a97ae42 [2025-03-08 05:54:02,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f0e9cae/435ce18ae2b7448ab48818993371961e [2025-03-08 05:54:02,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:54:02,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:54:02,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:54:02,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:54:02,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:54:02,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d8ec99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02, skipping insertion in model container [2025-03-08 05:54:02,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:54:02,337 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/token_ring.06.cil-2.c[671,684] [2025-03-08 05:54:02,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:54:02,434 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:54:02,441 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/token_ring.06.cil-2.c[671,684] [2025-03-08 05:54:02,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:54:02,505 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:54:02,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02 WrapperNode [2025-03-08 05:54:02,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:54:02,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:54:02,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:54:02,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:54:02,511 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:54:02" (1/1) ... [2025-03-08 05:54:02,519 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:54:02" (1/1) ... [2025-03-08 05:54:02,549 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 492 [2025-03-08 05:54:02,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:54:02,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:54:02,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:54:02,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:54:02,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,574 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:54:02,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:54:02,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:54:02,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:54:02,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:54:02,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (1/1) ... [2025-03-08 05:54:02,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:54:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:54:02,617 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:54:02,619 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:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:54:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:54:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:54:02,711 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:54:02,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:54:03,188 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-03-08 05:54:03,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:54:03,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:54:03,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:54:03,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:54:03 BoogieIcfgContainer [2025-03-08 05:54:03,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:54:03,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:54:03,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:54:03,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:54:03,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:54:02" (1/3) ... [2025-03-08 05:54:03,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c74e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:54:03, skipping insertion in model container [2025-03-08 05:54:03,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:02" (2/3) ... [2025-03-08 05:54:03,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c74e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:54:03, skipping insertion in model container [2025-03-08 05:54:03,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:54:03" (3/3) ... [2025-03-08 05:54:03,213 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2025-03-08 05:54:03,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:54:03,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-2.c that has 7 procedures, 230 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-08 05:54:03,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:54:03,278 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;@7780198f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:54:03,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:54:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 203 states have (on average 1.5862068965517242) internal successors, (322), 204 states have internal predecessors, (322), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 05:54:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:03,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:03,295 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:03,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1558834184, now seen corresponding path program 1 times [2025-03-08 05:54:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:03,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499809446] [2025-03-08 05:54:03,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:03,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:03,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:03,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:03,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:03,749 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:54:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:03,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499809446] [2025-03-08 05:54:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499809446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:03,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:03,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065534409] [2025-03-08 05:54:03,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:03,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:03,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:03,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:03,776 INFO L87 Difference]: Start difference. First operand has 230 states, 203 states have (on average 1.5862068965517242) internal successors, (322), 204 states have internal predecessors, (322), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:54:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:04,278 INFO L93 Difference]: Finished difference Result 684 states and 1088 transitions. [2025-03-08 05:54:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:54:04,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:04,290 INFO L225 Difference]: With dead ends: 684 [2025-03-08 05:54:04,291 INFO L226 Difference]: Without dead ends: 460 [2025-03-08 05:54:04,294 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:54:04,296 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 644 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:04,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 966 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-08 05:54:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 443. [2025-03-08 05:54:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 394 states have (on average 1.5609137055837563) internal successors, (615), 396 states have internal predecessors, (615), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-08 05:54:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 686 transitions. [2025-03-08 05:54:04,360 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 686 transitions. Word has length 109 [2025-03-08 05:54:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:04,360 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 686 transitions. [2025-03-08 05:54:04,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:54:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 686 transitions. [2025-03-08 05:54:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:04,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:04,367 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:04,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:54:04,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:04,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1649788742, now seen corresponding path program 1 times [2025-03-08 05:54:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824367301] [2025-03-08 05:54:04,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:04,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:04,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:04,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:04,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:04,581 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:54:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:04,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824367301] [2025-03-08 05:54:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824367301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:04,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179235677] [2025-03-08 05:54:04,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:04,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:04,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:04,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:04,587 INFO L87 Difference]: Start difference. First operand 443 states and 686 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:05,129 INFO L93 Difference]: Finished difference Result 1148 states and 1796 transitions. [2025-03-08 05:54:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:05,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:05,134 INFO L225 Difference]: With dead ends: 1148 [2025-03-08 05:54:05,134 INFO L226 Difference]: Without dead ends: 719 [2025-03-08 05:54:05,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:54:05,137 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 638 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:05,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1780 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-08 05:54:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 646. [2025-03-08 05:54:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 575 states have (on average 1.5530434782608695) internal successors, (893), 578 states have internal predecessors, (893), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-08 05:54:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 997 transitions. [2025-03-08 05:54:05,179 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 997 transitions. Word has length 109 [2025-03-08 05:54:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:05,180 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 997 transitions. [2025-03-08 05:54:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 997 transitions. [2025-03-08 05:54:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:05,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:05,184 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:54:05,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:05,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1664038887, now seen corresponding path program 1 times [2025-03-08 05:54:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657972157] [2025-03-08 05:54:05,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:05,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:05,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:05,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:05,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:05,349 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:54:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657972157] [2025-03-08 05:54:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657972157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:05,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552178250] [2025-03-08 05:54:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:05,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:05,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:05,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:05,353 INFO L87 Difference]: Start difference. First operand 646 states and 997 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:05,841 INFO L93 Difference]: Finished difference Result 1791 states and 2796 transitions. [2025-03-08 05:54:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:05,848 INFO L225 Difference]: With dead ends: 1791 [2025-03-08 05:54:05,848 INFO L226 Difference]: Without dead ends: 1159 [2025-03-08 05:54:05,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:54:05,852 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 633 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:05,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1764 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-08 05:54:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1077. [2025-03-08 05:54:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 960 states have (on average 1.5541666666666667) internal successors, (1492), 967 states have internal predecessors, (1492), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-08 05:54:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1668 transitions. [2025-03-08 05:54:05,943 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1668 transitions. Word has length 109 [2025-03-08 05:54:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:05,944 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1668 transitions. [2025-03-08 05:54:05,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1668 transitions. [2025-03-08 05:54:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:05,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:05,946 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:05,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:54:05,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:05,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1660637402, now seen corresponding path program 1 times [2025-03-08 05:54:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321667464] [2025-03-08 05:54:05,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:05,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:05,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:06,117 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:54:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321667464] [2025-03-08 05:54:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321667464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889720086] [2025-03-08 05:54:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:06,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:06,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:06,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:06,119 INFO L87 Difference]: Start difference. First operand 1077 states and 1668 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:06,651 INFO L93 Difference]: Finished difference Result 3172 states and 4989 transitions. [2025-03-08 05:54:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:06,663 INFO L225 Difference]: With dead ends: 3172 [2025-03-08 05:54:06,663 INFO L226 Difference]: Without dead ends: 2109 [2025-03-08 05:54:06,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:54:06,667 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 628 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:06,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1752 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2025-03-08 05:54:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2008. [2025-03-08 05:54:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1793 states have (on average 1.566090351366425) internal successors, (2808), 1814 states have internal predecessors, (2808), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-08 05:54:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 3152 transitions. [2025-03-08 05:54:06,797 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 3152 transitions. Word has length 109 [2025-03-08 05:54:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:06,797 INFO L471 AbstractCegarLoop]: Abstraction has 2008 states and 3152 transitions. [2025-03-08 05:54:06,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 3152 transitions. [2025-03-08 05:54:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:06,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:06,801 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:06,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:54:06,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:06,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1695798279, now seen corresponding path program 1 times [2025-03-08 05:54:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901660188] [2025-03-08 05:54:06,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:06,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:06,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:06,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:06,916 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:54:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901660188] [2025-03-08 05:54:06,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901660188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:06,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:06,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732655475] [2025-03-08 05:54:06,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:06,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:06,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:06,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:06,917 INFO L87 Difference]: Start difference. First operand 2008 states and 3152 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:07,478 INFO L93 Difference]: Finished difference Result 6191 states and 9931 transitions. [2025-03-08 05:54:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:07,501 INFO L225 Difference]: With dead ends: 6191 [2025-03-08 05:54:07,501 INFO L226 Difference]: Without dead ends: 4197 [2025-03-08 05:54:07,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:54:07,510 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 623 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:07,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1740 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2025-03-08 05:54:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4059. [2025-03-08 05:54:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 3630 states have (on average 1.5867768595041323) internal successors, (5760), 3697 states have internal predecessors, (5760), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-08 05:54:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 6536 transitions. [2025-03-08 05:54:07,718 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 6536 transitions. Word has length 109 [2025-03-08 05:54:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:07,718 INFO L471 AbstractCegarLoop]: Abstraction has 4059 states and 6536 transitions. [2025-03-08 05:54:07,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 6536 transitions. [2025-03-08 05:54:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:07,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:07,722 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:54:07,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2081165062, now seen corresponding path program 1 times [2025-03-08 05:54:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857906963] [2025-03-08 05:54:07,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:07,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:07,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:07,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:07,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:07,825 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:54:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857906963] [2025-03-08 05:54:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857906963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922799518] [2025-03-08 05:54:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:07,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:07,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:07,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:07,826 INFO L87 Difference]: Start difference. First operand 4059 states and 6536 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:08,428 INFO L93 Difference]: Finished difference Result 12926 states and 21461 transitions. [2025-03-08 05:54:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:08,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:08,483 INFO L225 Difference]: With dead ends: 12926 [2025-03-08 05:54:08,484 INFO L226 Difference]: Without dead ends: 8881 [2025-03-08 05:54:08,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:54:08,503 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 644 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:08,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1225 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2025-03-08 05:54:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 8674. [2025-03-08 05:54:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8674 states, 7763 states have (on average 1.6127785649877624) internal successors, (12520), 7976 states have internal predecessors, (12520), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-08 05:54:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 14544 transitions. [2025-03-08 05:54:08,903 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 14544 transitions. Word has length 109 [2025-03-08 05:54:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:08,903 INFO L471 AbstractCegarLoop]: Abstraction has 8674 states and 14544 transitions. [2025-03-08 05:54:08,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 14544 transitions. [2025-03-08 05:54:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:08,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:08,910 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:54:08,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -431028263, now seen corresponding path program 1 times [2025-03-08 05:54:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061335063] [2025-03-08 05:54:08,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:08,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:08,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:09,017 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:54:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061335063] [2025-03-08 05:54:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061335063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709271146] [2025-03-08 05:54:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:09,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:09,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:09,020 INFO L87 Difference]: Start difference. First operand 8674 states and 14544 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:10,014 INFO L93 Difference]: Finished difference Result 29499 states and 51240 transitions. [2025-03-08 05:54:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:10,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:10,109 INFO L225 Difference]: With dead ends: 29499 [2025-03-08 05:54:10,110 INFO L226 Difference]: Without dead ends: 20839 [2025-03-08 05:54:10,140 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:54:10,140 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 804 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1689 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20839 states. [2025-03-08 05:54:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20839 to 18942. [2025-03-08 05:54:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18942 states, 16937 states have (on average 1.6379524118793174) internal successors, (27742), 17604 states have internal predecessors, (27742), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-08 05:54:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18942 states to 18942 states and 33734 transitions. [2025-03-08 05:54:11,060 INFO L78 Accepts]: Start accepts. Automaton has 18942 states and 33734 transitions. Word has length 109 [2025-03-08 05:54:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:11,060 INFO L471 AbstractCegarLoop]: Abstraction has 18942 states and 33734 transitions. [2025-03-08 05:54:11,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 18942 states and 33734 transitions. [2025-03-08 05:54:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:11,072 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:11,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:54:11,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:11,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash 737167992, now seen corresponding path program 1 times [2025-03-08 05:54:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:11,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810768139] [2025-03-08 05:54:11,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:11,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:11,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:11,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:11,176 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:54:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810768139] [2025-03-08 05:54:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810768139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821321385] [2025-03-08 05:54:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:11,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:11,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:11,179 INFO L87 Difference]: Start difference. First operand 18942 states and 33734 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:54:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:12,128 INFO L93 Difference]: Finished difference Result 42987 states and 79714 transitions. [2025-03-08 05:54:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:54:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:12,220 INFO L225 Difference]: With dead ends: 42987 [2025-03-08 05:54:12,220 INFO L226 Difference]: Without dead ends: 24059 [2025-03-08 05:54:12,261 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:54:12,264 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 449 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:12,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 632 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:54:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24059 states. [2025-03-08 05:54:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24059 to 18942. [2025-03-08 05:54:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18942 states, 16937 states have (on average 1.6341146602113716) internal successors, (27677), 17604 states have internal predecessors, (27677), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-08 05:54:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18942 states to 18942 states and 33669 transitions. [2025-03-08 05:54:13,137 INFO L78 Accepts]: Start accepts. Automaton has 18942 states and 33669 transitions. Word has length 109 [2025-03-08 05:54:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:13,138 INFO L471 AbstractCegarLoop]: Abstraction has 18942 states and 33669 transitions. [2025-03-08 05:54:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:54:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 18942 states and 33669 transitions. [2025-03-08 05:54:13,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:13,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:13,149 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:13,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:54:13,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -472074247, now seen corresponding path program 1 times [2025-03-08 05:54:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209261400] [2025-03-08 05:54:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:13,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:13,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:13,247 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:54:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209261400] [2025-03-08 05:54:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209261400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:13,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725447374] [2025-03-08 05:54:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:13,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:13,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:13,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:13,250 INFO L87 Difference]: Start difference. First operand 18942 states and 33669 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:15,234 INFO L93 Difference]: Finished difference Result 63463 states and 119333 transitions. [2025-03-08 05:54:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:15,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:15,428 INFO L225 Difference]: With dead ends: 63463 [2025-03-08 05:54:15,428 INFO L226 Difference]: Without dead ends: 44535 [2025-03-08 05:54:15,484 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:54:15,484 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 731 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:15,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1658 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44535 states. [2025-03-08 05:54:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44535 to 41812. [2025-03-08 05:54:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41812 states, 37165 states have (on average 1.651096461724741) internal successors, (61363), 39226 states have internal predecessors, (61363), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 05:54:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41812 states to 41812 states and 81371 transitions. [2025-03-08 05:54:17,355 INFO L78 Accepts]: Start accepts. Automaton has 41812 states and 81371 transitions. Word has length 109 [2025-03-08 05:54:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 41812 states and 81371 transitions. [2025-03-08 05:54:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 41812 states and 81371 transitions. [2025-03-08 05:54:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:17,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:17,375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:17,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:54:17,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 735843928, now seen corresponding path program 1 times [2025-03-08 05:54:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801907642] [2025-03-08 05:54:17,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:17,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:17,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:17,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:17,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:17,456 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:54:17,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:17,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801907642] [2025-03-08 05:54:17,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801907642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:17,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:17,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826816418] [2025-03-08 05:54:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:17,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:17,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:17,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:17,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:17,459 INFO L87 Difference]: Start difference. First operand 41812 states and 81371 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:54:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:19,836 INFO L93 Difference]: Finished difference Result 94555 states and 194686 transitions. [2025-03-08 05:54:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:54:19,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:20,186 INFO L225 Difference]: With dead ends: 94555 [2025-03-08 05:54:20,186 INFO L226 Difference]: Without dead ends: 52757 [2025-03-08 05:54:20,346 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:54:20,347 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 445 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:20,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 618 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:54:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52757 states. [2025-03-08 05:54:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52757 to 41812. [2025-03-08 05:54:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41812 states, 37165 states have (on average 1.6476254540562356) internal successors, (61234), 39226 states have internal predecessors, (61234), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 05:54:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41812 states to 41812 states and 81242 transitions. [2025-03-08 05:54:24,537 INFO L78 Accepts]: Start accepts. Automaton has 41812 states and 81242 transitions. Word has length 109 [2025-03-08 05:54:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:24,538 INFO L471 AbstractCegarLoop]: Abstraction has 41812 states and 81242 transitions. [2025-03-08 05:54:24,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:54:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 41812 states and 81242 transitions. [2025-03-08 05:54:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:24,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:24,559 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:24,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:54:24,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:24,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash -749211623, now seen corresponding path program 1 times [2025-03-08 05:54:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:24,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892304091] [2025-03-08 05:54:24,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:24,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:24,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:24,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:24,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:24,668 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:54:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892304091] [2025-03-08 05:54:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892304091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473504072] [2025-03-08 05:54:24,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:24,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:24,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:24,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:24,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:24,672 INFO L87 Difference]: Start difference. First operand 41812 states and 81242 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:28,914 INFO L93 Difference]: Finished difference Result 136889 states and 291790 transitions. [2025-03-08 05:54:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-03-08 05:54:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:29,436 INFO L225 Difference]: With dead ends: 136889 [2025-03-08 05:54:29,436 INFO L226 Difference]: Without dead ends: 95091 [2025-03-08 05:54:29,579 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:54:29,579 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 658 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:29,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1627 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95091 states. [2025-03-08 05:54:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95091 to 91734. [2025-03-08 05:54:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91734 states, 80409 states have (on average 1.6498153191806888) internal successors, (132660), 86716 states have internal predecessors, (132660), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-03-08 05:54:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91734 states to 91734 states and 205148 transitions. [2025-03-08 05:54:36,510 INFO L78 Accepts]: Start accepts. Automaton has 91734 states and 205148 transitions. Word has length 109 [2025-03-08 05:54:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 91734 states and 205148 transitions. [2025-03-08 05:54:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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:54:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 91734 states and 205148 transitions. [2025-03-08 05:54:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:54:36,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:36,546 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:36,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:54:36,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash 34167352, now seen corresponding path program 1 times [2025-03-08 05:54:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:36,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747455579] [2025-03-08 05:54:36,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:36,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:54:36,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:54:36,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:36,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:36,660 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:54:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:36,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747455579] [2025-03-08 05:54:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747455579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:36,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:36,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125065640] [2025-03-08 05:54:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:36,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:36,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:36,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:36,662 INFO L87 Difference]: Start difference. First operand 91734 states and 205148 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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)