./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:07:30,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:07:30,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:07:30,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:07:30,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:07:30,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:07:30,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:07:30,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:07:30,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:07:30,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:07:30,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:07:30,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:07:30,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:07:30,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:07:30,278 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:07:30,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:07:30,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:07:30,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:07:30,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:07:30,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:07:30,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:07:30,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:07:30,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:07:30,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:07:30,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:07:30,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 [2025-02-05 16:07:30,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:07:30,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:07:30,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:07:30,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:07:30,571 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:07:30,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2025-02-05 16:07:31,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4bacb52/08318d831a49471d92aa6a82191f313b/FLAG54e663d30 [2025-02-05 16:07:32,240 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:07:32,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2025-02-05 16:07:32,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4bacb52/08318d831a49471d92aa6a82191f313b/FLAG54e663d30 [2025-02-05 16:07:32,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4bacb52/08318d831a49471d92aa6a82191f313b [2025-02-05 16:07:32,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:07:32,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:07:32,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:07:32,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:07:32,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:07:32,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667df326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32, skipping insertion in model container [2025-02-05 16:07:32,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:07:32,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2025-02-05 16:07:32,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:07:32,479 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:07:32,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2025-02-05 16:07:32,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:07:32,546 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:07:32,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32 WrapperNode [2025-02-05 16:07:32,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:07:32,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:07:32,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:07:32,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:07:32,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,596 INFO L138 Inliner]: procedures = 38, calls = 46, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 435 [2025-02-05 16:07:32,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:07:32,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:07:32,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:07:32,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:07:32,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,621 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:07:32,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:07:32,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:07:32,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:07:32,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:07:32,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:07:32,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:32,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:07:32,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:07:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:07:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:07:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:07:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:07:32,691 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:07:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 16:07:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 16:07:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:07:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:07:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:07:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:07:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:07:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:07:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:07:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:07:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:07:32,766 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:07:32,768 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:07:33,213 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-05 16:07:33,213 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:07:33,222 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:07:33,222 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:07:33,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:07:33 BoogieIcfgContainer [2025-02-05 16:07:33,222 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:07:33,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:07:33,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:07:33,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:07:33,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:07:32" (1/3) ... [2025-02-05 16:07:33,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ed6551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:07:33, skipping insertion in model container [2025-02-05 16:07:33,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (2/3) ... [2025-02-05 16:07:33,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ed6551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:07:33, skipping insertion in model container [2025-02-05 16:07:33,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:07:33" (3/3) ... [2025-02-05 16:07:33,229 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2025-02-05 16:07:33,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:07:33,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.05.cil-1.c that has 7 procedures, 219 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-02-05 16:07:33,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:07:33,297 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;@6a6207d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:07:33,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:07:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 192 states have (on average 1.5416666666666667) internal successors, (296), 194 states have internal predecessors, (296), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 16:07:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:33,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:33,308 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] [2025-02-05 16:07:33,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1318627255, now seen corresponding path program 1 times [2025-02-05 16:07:33,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028822765] [2025-02-05 16:07:33,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:33,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:33,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:33,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:33,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028822765] [2025-02-05 16:07:33,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028822765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:33,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:33,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029118289] [2025-02-05 16:07:33,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:33,766 INFO L87 Difference]: Start difference. First operand has 219 states, 192 states have (on average 1.5416666666666667) internal successors, (296), 194 states have internal predecessors, (296), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-02-05 16:07:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:34,229 INFO L93 Difference]: Finished difference Result 649 states and 1000 transitions. [2025-02-05 16:07:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:07:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:34,242 INFO L225 Difference]: With dead ends: 649 [2025-02-05 16:07:34,242 INFO L226 Difference]: Without dead ends: 435 [2025-02-05 16:07:34,247 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-02-05 16:07:34,249 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 573 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:34,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 975 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-02-05 16:07:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 420. [2025-02-05 16:07:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 373 states have (on average 1.5093833780160857) internal successors, (563), 375 states have internal predecessors, (563), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-02-05 16:07:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 630 transitions. [2025-02-05 16:07:34,312 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 630 transitions. Word has length 100 [2025-02-05 16:07:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:34,312 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 630 transitions. [2025-02-05 16:07:34,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-02-05 16:07:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 630 transitions. [2025-02-05 16:07:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:34,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:34,316 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] [2025-02-05 16:07:34,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:07:34,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:34,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 460184953, now seen corresponding path program 1 times [2025-02-05 16:07:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413858140] [2025-02-05 16:07:34,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:34,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:34,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:34,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:34,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413858140] [2025-02-05 16:07:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413858140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:34,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002991631] [2025-02-05 16:07:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:34,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:34,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:34,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:34,581 INFO L87 Difference]: Start difference. First operand 420 states and 630 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:35,133 INFO L93 Difference]: Finished difference Result 1083 states and 1641 transitions. [2025-02-05 16:07:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:35,143 INFO L225 Difference]: With dead ends: 1083 [2025-02-05 16:07:35,143 INFO L226 Difference]: Without dead ends: 676 [2025-02-05 16:07:35,147 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-02-05 16:07:35,147 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 565 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:35,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1677 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:07:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-02-05 16:07:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 613. [2025-02-05 16:07:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 545 states have (on average 1.5009174311926605) internal successors, (818), 548 states have internal predecessors, (818), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-02-05 16:07:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 916 transitions. [2025-02-05 16:07:35,243 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 916 transitions. Word has length 100 [2025-02-05 16:07:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:35,243 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 916 transitions. [2025-02-05 16:07:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 916 transitions. [2025-02-05 16:07:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:35,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:35,250 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] [2025-02-05 16:07:35,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:07:35,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:35,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1668103128, now seen corresponding path program 1 times [2025-02-05 16:07:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-02-05 16:07:35,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:35,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:35,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:35,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:35,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:35,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-02-05 16:07:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-02-05 16:07:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300340037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326951653] [2025-02-05 16:07:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:35,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:35,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:35,457 INFO L87 Difference]: Start difference. First operand 613 states and 916 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:35,979 INFO L93 Difference]: Finished difference Result 1690 states and 2554 transitions. [2025-02-05 16:07:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:35,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:35,987 INFO L225 Difference]: With dead ends: 1690 [2025-02-05 16:07:35,987 INFO L226 Difference]: Without dead ends: 1090 [2025-02-05 16:07:35,989 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-02-05 16:07:35,991 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 560 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:35,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1661 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:07:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-02-05 16:07:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1020. [2025-02-05 16:07:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 908 states have (on average 1.501101321585903) internal successors, (1363), 915 states have internal predecessors, (1363), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-02-05 16:07:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1529 transitions. [2025-02-05 16:07:36,060 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1529 transitions. Word has length 100 [2025-02-05 16:07:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1529 transitions. [2025-02-05 16:07:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1529 transitions. [2025-02-05 16:07:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:36,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:36,064 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] [2025-02-05 16:07:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:07:36,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 183047577, now seen corresponding path program 1 times [2025-02-05 16:07:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-02-05 16:07:36,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:36,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:36,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:36,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-02-05 16:07:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41178267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103065869] [2025-02-05 16:07:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:36,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:36,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:36,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:36,241 INFO L87 Difference]: Start difference. First operand 1020 states and 1529 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:36,771 INFO L93 Difference]: Finished difference Result 2983 states and 4541 transitions. [2025-02-05 16:07:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:36,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:36,780 INFO L225 Difference]: With dead ends: 2983 [2025-02-05 16:07:36,780 INFO L226 Difference]: Without dead ends: 1976 [2025-02-05 16:07:36,783 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-02-05 16:07:36,783 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 555 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:36,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1649 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-02-05 16:07:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1891. [2025-02-05 16:07:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1685 states have (on average 1.5115727002967358) internal successors, (2547), 1706 states have internal predecessors, (2547), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-02-05 16:07:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2873 transitions. [2025-02-05 16:07:36,886 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2873 transitions. Word has length 100 [2025-02-05 16:07:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:36,886 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2873 transitions. [2025-02-05 16:07:36,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2873 transitions. [2025-02-05 16:07:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:36,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:36,888 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] [2025-02-05 16:07:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:07:36,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 966426552, now seen corresponding path program 1 times [2025-02-05 16:07:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804558966] [2025-02-05 16:07:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:36,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:36,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:36,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:36,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:36,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804558966] [2025-02-05 16:07:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804558966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85827516] [2025-02-05 16:07:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:36,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:36,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:36,994 INFO L87 Difference]: Start difference. First operand 1891 states and 2873 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:37,473 INFO L93 Difference]: Finished difference Result 5778 states and 8975 transitions. [2025-02-05 16:07:37,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:37,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:37,491 INFO L225 Difference]: With dead ends: 5778 [2025-02-05 16:07:37,492 INFO L226 Difference]: Without dead ends: 3900 [2025-02-05 16:07:37,497 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-02-05 16:07:37,498 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 550 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:37,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1637 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:07:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2025-02-05 16:07:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 3786. [2025-02-05 16:07:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3786 states, 3374 states have (on average 1.5302311796087729) internal successors, (5163), 3441 states have internal predecessors, (5163), 243 states have call successors, (243), 102 states have call predecessors, (243), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-02-05 16:07:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5905 transitions. [2025-02-05 16:07:37,727 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5905 transitions. Word has length 100 [2025-02-05 16:07:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:37,728 INFO L471 AbstractCegarLoop]: Abstraction has 3786 states and 5905 transitions. [2025-02-05 16:07:37,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5905 transitions. [2025-02-05 16:07:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:37,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:37,736 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] [2025-02-05 16:07:37,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:07:37,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:37,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash 437507513, now seen corresponding path program 1 times [2025-02-05 16:07:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615724958] [2025-02-05 16:07:37,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:37,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:37,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:37,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:37,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615724958] [2025-02-05 16:07:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615724958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:37,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:37,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78084974] [2025-02-05 16:07:37,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:37,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:37,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:37,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:37,855 INFO L87 Difference]: Start difference. First operand 3786 states and 5905 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:38,481 INFO L93 Difference]: Finished difference Result 11921 states and 19201 transitions. [2025-02-05 16:07:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:38,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:38,521 INFO L225 Difference]: With dead ends: 11921 [2025-02-05 16:07:38,521 INFO L226 Difference]: Without dead ends: 8148 [2025-02-05 16:07:38,533 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-02-05 16:07:38,535 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 545 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:38,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1625 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8148 states. [2025-02-05 16:07:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8148 to 7981. [2025-02-05 16:07:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7981 states, 7103 states have (on average 1.5535689145431508) internal successors, (11035), 7316 states have internal predecessors, (11035), 467 states have call successors, (467), 198 states have call predecessors, (467), 410 states have return successors, (1491), 498 states have call predecessors, (1491), 467 states have call successors, (1491) [2025-02-05 16:07:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7981 states to 7981 states and 12993 transitions. [2025-02-05 16:07:38,977 INFO L78 Accepts]: Start accepts. Automaton has 7981 states and 12993 transitions. Word has length 100 [2025-02-05 16:07:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:38,977 INFO L471 AbstractCegarLoop]: Abstraction has 7981 states and 12993 transitions. [2025-02-05 16:07:38,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7981 states and 12993 transitions. [2025-02-05 16:07:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:38,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:38,983 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] [2025-02-05 16:07:38,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:07:38,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:38,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash -133743720, now seen corresponding path program 1 times [2025-02-05 16:07:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:38,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119990963] [2025-02-05 16:07:38,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:38,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:38,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:38,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:38,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119990963] [2025-02-05 16:07:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119990963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342666242] [2025-02-05 16:07:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:39,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:39,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:39,093 INFO L87 Difference]: Start difference. First operand 7981 states and 12993 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:39,961 INFO L93 Difference]: Finished difference Result 26932 states and 45712 transitions. [2025-02-05 16:07:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:40,050 INFO L225 Difference]: With dead ends: 26932 [2025-02-05 16:07:40,050 INFO L226 Difference]: Without dead ends: 18964 [2025-02-05 16:07:40,075 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-02-05 16:07:40,076 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 704 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:40,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1600 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18964 states. [2025-02-05 16:07:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18964 to 17328. [2025-02-05 16:07:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17328 states, 15388 states have (on average 1.5803873147907461) internal successors, (24319), 16055 states have internal predecessors, (24319), 883 states have call successors, (883), 390 states have call predecessors, (883), 1056 states have return successors, (4979), 946 states have call predecessors, (4979), 883 states have call successors, (4979) [2025-02-05 16:07:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17328 states to 17328 states and 30181 transitions. [2025-02-05 16:07:40,964 INFO L78 Accepts]: Start accepts. Automaton has 17328 states and 30181 transitions. Word has length 100 [2025-02-05 16:07:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 17328 states and 30181 transitions. [2025-02-05 16:07:40,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17328 states and 30181 transitions. [2025-02-05 16:07:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:40,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:40,978 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] [2025-02-05 16:07:40,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:07:40,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:40,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -13623847, now seen corresponding path program 1 times [2025-02-05 16:07:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010481445] [2025-02-05 16:07:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:40,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:40,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:40,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:41,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010481445] [2025-02-05 16:07:41,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010481445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:41,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:41,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:41,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495179068] [2025-02-05 16:07:41,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:41,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:41,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:41,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:41,087 INFO L87 Difference]: Start difference. First operand 17328 states and 30181 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:42,129 INFO L93 Difference]: Finished difference Result 39029 states and 71148 transitions. [2025-02-05 16:07:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:07:42,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:42,223 INFO L225 Difference]: With dead ends: 39029 [2025-02-05 16:07:42,223 INFO L226 Difference]: Without dead ends: 21714 [2025-02-05 16:07:42,276 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-02-05 16:07:42,278 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 405 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:42,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 594 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21714 states. [2025-02-05 16:07:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21714 to 17328. [2025-02-05 16:07:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17328 states, 15388 states have (on average 1.576163244086301) internal successors, (24254), 16055 states have internal predecessors, (24254), 883 states have call successors, (883), 390 states have call predecessors, (883), 1056 states have return successors, (4979), 946 states have call predecessors, (4979), 883 states have call successors, (4979) [2025-02-05 16:07:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17328 states to 17328 states and 30116 transitions. [2025-02-05 16:07:43,329 INFO L78 Accepts]: Start accepts. Automaton has 17328 states and 30116 transitions. Word has length 100 [2025-02-05 16:07:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 17328 states and 30116 transitions. [2025-02-05 16:07:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17328 states and 30116 transitions. [2025-02-05 16:07:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:43,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:43,339 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] [2025-02-05 16:07:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:07:43,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 405892984, now seen corresponding path program 1 times [2025-02-05 16:07:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207907988] [2025-02-05 16:07:43,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:43,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:43,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:43,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:43,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207907988] [2025-02-05 16:07:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207907988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119429438] [2025-02-05 16:07:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:43,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:43,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:43,429 INFO L87 Difference]: Start difference. First operand 17328 states and 30116 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:45,303 INFO L93 Difference]: Finished difference Result 57391 states and 106411 transitions. [2025-02-05 16:07:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:45,498 INFO L225 Difference]: With dead ends: 57391 [2025-02-05 16:07:45,498 INFO L226 Difference]: Without dead ends: 40076 [2025-02-05 16:07:45,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:07:45,568 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 631 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:45,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1569 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40076 states. [2025-02-05 16:07:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40076 to 37870. [2025-02-05 16:07:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37870 states, 33352 states have (on average 1.5918685536099784) internal successors, (53092), 35413 states have internal predecessors, (53092), 1683 states have call successors, (1683), 774 states have call predecessors, (1683), 2834 states have return successors, (18067), 1810 states have call predecessors, (18067), 1683 states have call successors, (18067) [2025-02-05 16:07:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37870 states to 37870 states and 72842 transitions. [2025-02-05 16:07:47,967 INFO L78 Accepts]: Start accepts. Automaton has 37870 states and 72842 transitions. Word has length 100 [2025-02-05 16:07:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:47,967 INFO L471 AbstractCegarLoop]: Abstraction has 37870 states and 72842 transitions. [2025-02-05 16:07:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37870 states and 72842 transitions. [2025-02-05 16:07:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:47,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:47,983 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] [2025-02-05 16:07:47,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:07:47,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 419425785, now seen corresponding path program 1 times [2025-02-05 16:07:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016637281] [2025-02-05 16:07:47,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:47,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:47,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:47,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:47,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:48,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016637281] [2025-02-05 16:07:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016637281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:48,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:48,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698418192] [2025-02-05 16:07:48,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:48,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:48,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:48,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:48,053 INFO L87 Difference]: Start difference. First operand 37870 states and 72842 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:50,494 INFO L93 Difference]: Finished difference Result 84483 states and 173252 transitions. [2025-02-05 16:07:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:07:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:50,674 INFO L225 Difference]: With dead ends: 84483 [2025-02-05 16:07:50,675 INFO L226 Difference]: Without dead ends: 46626 [2025-02-05 16:07:50,753 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-02-05 16:07:50,754 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 401 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:50,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 580 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:07:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46626 states. [2025-02-05 16:07:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46626 to 37870. [2025-02-05 16:07:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37870 states, 33352 states have (on average 1.5880007195970256) internal successors, (52963), 35413 states have internal predecessors, (52963), 1683 states have call successors, (1683), 774 states have call predecessors, (1683), 2834 states have return successors, (18067), 1810 states have call predecessors, (18067), 1683 states have call successors, (18067) [2025-02-05 16:07:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37870 states to 37870 states and 72713 transitions. [2025-02-05 16:07:53,256 INFO L78 Accepts]: Start accepts. Automaton has 37870 states and 72713 transitions. Word has length 100 [2025-02-05 16:07:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 37870 states and 72713 transitions. [2025-02-05 16:07:53,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 37870 states and 72713 transitions. [2025-02-05 16:07:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:07:53,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:53,274 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] [2025-02-05 16:07:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:07:53,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1528240984, now seen corresponding path program 1 times [2025-02-05 16:07:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116911623] [2025-02-05 16:07:53,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:53,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:07:53,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:07:53,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:53,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116911623] [2025-02-05 16:07:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116911623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858375008] [2025-02-05 16:07:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:53,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:53,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:53,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:53,367 INFO L87 Difference]: Start difference. First operand 37870 states and 72713 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:07:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:56,743 INFO L93 Difference]: Finished difference Result 121863 states and 260192 transitions. [2025-02-05 16:07:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:56,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-02-05 16:07:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:57,125 INFO L225 Difference]: With dead ends: 121863 [2025-02-05 16:07:57,125 INFO L226 Difference]: Without dead ends: 84006 [2025-02-05 16:07:57,411 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-02-05 16:07:57,412 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 558 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:57,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1538 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84006 states. [2025-02-05 16:08:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84006 to 81678. [2025-02-05 16:08:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81678 states, 70610 states have (on average 1.5830194023509419) internal successors, (111777), 76917 states have internal predecessors, (111777), 3219 states have call successors, (3219), 1542 states have call predecessors, (3219), 7848 states have return successors, (68755), 3474 states have call predecessors, (68755), 3219 states have call successors, (68755) [2025-02-05 16:08:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81678 states to 81678 states and 183751 transitions. [2025-02-05 16:08:02,522 INFO L78 Accepts]: Start accepts. Automaton has 81678 states and 183751 transitions. Word has length 100 [2025-02-05 16:08:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:02,522 INFO L471 AbstractCegarLoop]: Abstraction has 81678 states and 183751 transitions. [2025-02-05 16:08:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-02-05 16:08:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 81678 states and 183751 transitions. [2025-02-05 16:08:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:08:02,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:02,547 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] [2025-02-05 16:08:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:08:02,548 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:02,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1899674087, now seen corresponding path program 1 times [2025-02-05 16:08:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697553803] [2025-02-05 16:08:02,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:02,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:08:02,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:08:02,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:02,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697553803] [2025-02-05 16:08:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697553803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652254564] [2025-02-05 16:08:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:02,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:02,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:02,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:02,640 INFO L87 Difference]: Start difference. First operand 81678 states and 183751 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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)