./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4710f8f3a918a0191222414f5c33a367ff98c09c2e8598fa3213223c4c35dba --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:43:33,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:43:33,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:43:33,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:43:33,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:43:33,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:43:33,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:43:33,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:43:33,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:43:33,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:43:33,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:43:33,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:43:33,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:43:33,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:43:33,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:43:33,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:43:33,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:43:33,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:43:33,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:43:33,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:43:33,294 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4710f8f3a918a0191222414f5c33a367ff98c09c2e8598fa3213223c4c35dba [2025-03-03 14:43:33,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:43:33,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:43:33,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:43:33,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:43:33,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:43:33,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.04.cil-1.c [2025-03-03 14:43:34,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4bb6676/f6161f88d21a46dd8974c6c681844455/FLAG389fd9f13 [2025-03-03 14:43:34,901 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:43:34,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c [2025-03-03 14:43:34,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4bb6676/f6161f88d21a46dd8974c6c681844455/FLAG389fd9f13 [2025-03-03 14:43:35,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4bb6676/f6161f88d21a46dd8974c6c681844455 [2025-03-03 14:43:35,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:43:35,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:43:35,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:43:35,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:43:35,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:43:35,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a24b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35, skipping insertion in model container [2025-03-03 14:43:35,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:43:35,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c[671,684] [2025-03-03 14:43:35,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:43:35,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:43:35,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c[671,684] [2025-03-03 14:43:35,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:43:35,455 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:43:35,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35 WrapperNode [2025-03-03 14:43:35,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:43:35,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:43:35,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:43:35,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:43:35,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,479 INFO L138 Inliner]: procedures = 36, calls = 43, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 378 [2025-03-03 14:43:35,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:43:35,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:43:35,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:43:35,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:43:35,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,498 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:43:35,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:43:35,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:43:35,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:43:35,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:43:35,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (1/1) ... [2025-03-03 14:43:35,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:43:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:35,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:43:35,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:43:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:43:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:43:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:43:35,554 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:43:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:43:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 14:43:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 14:43:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:43:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:43:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:43:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:43:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:43:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:43:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:43:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:43:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:43:35,620 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:43:35,621 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:43:35,976 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-03 14:43:35,976 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:43:35,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:43:35,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:43:35,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:35 BoogieIcfgContainer [2025-03-03 14:43:35,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:43:35,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:43:35,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:43:35,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:43:35,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:43:35" (1/3) ... [2025-03-03 14:43:35,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfc38a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:43:35, skipping insertion in model container [2025-03-03 14:43:35,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:35" (2/3) ... [2025-03-03 14:43:35,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfc38a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:43:35, skipping insertion in model container [2025-03-03 14:43:35,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:35" (3/3) ... [2025-03-03 14:43:35,995 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-1.c [2025-03-03 14:43:36,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:43:36,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.04.cil-1.c that has 7 procedures, 192 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-03 14:43:36,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:43:36,052 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;@2d43519b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:43:36,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:43:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 166 states have (on average 1.5301204819277108) internal successors, (254), 168 states have internal predecessors, (254), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 14:43:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:36,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43: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] [2025-03-03 14:43:36,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1922204709, now seen corresponding path program 1 times [2025-03-03 14:43:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053347474] [2025-03-03 14:43:36,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:36,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:36,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:36,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:36,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053347474] [2025-03-03 14:43:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053347474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:43:36,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37696203] [2025-03-03 14:43:36,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:36,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:43:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:36,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:43:36,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:43:36,446 INFO L87 Difference]: Start difference. First operand has 192 states, 166 states have (on average 1.5301204819277108) internal successors, (254), 168 states have internal predecessors, (254), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:36,806 INFO L93 Difference]: Finished difference Result 566 states and 864 transitions. [2025-03-03 14:43:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:43:36,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:36,819 INFO L225 Difference]: With dead ends: 566 [2025-03-03 14:43:36,819 INFO L226 Difference]: Without dead ends: 378 [2025-03-03 14:43:36,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:36,824 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 486 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:36,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 782 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-03 14:43:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 365. [2025-03-03 14:43:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 320 states have (on average 1.496875) internal successors, (479), 322 states have internal predecessors, (479), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 14:43:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 542 transitions. [2025-03-03 14:43:36,875 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 542 transitions. Word has length 89 [2025-03-03 14:43:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:36,875 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 542 transitions. [2025-03-03 14:43:36,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 542 transitions. [2025-03-03 14:43:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:36,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:36,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:36,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:43:36,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -812608665, now seen corresponding path program 1 times [2025-03-03 14:43:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961515249] [2025-03-03 14:43:36,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:36,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:36,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:36,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:37,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961515249] [2025-03-03 14:43:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961515249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:37,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:37,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208874096] [2025-03-03 14:43:37,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:37,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:37,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:37,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:37,086 INFO L87 Difference]: Start difference. First operand 365 states and 542 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:37,518 INFO L93 Difference]: Finished difference Result 938 states and 1406 transitions. [2025-03-03 14:43:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:37,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:37,522 INFO L225 Difference]: With dead ends: 938 [2025-03-03 14:43:37,522 INFO L226 Difference]: Without dead ends: 585 [2025-03-03 14:43:37,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:37,524 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 476 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:37,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1430 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:43:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-03 14:43:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 532. [2025-03-03 14:43:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.488222698072805) internal successors, (695), 470 states have internal predecessors, (695), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-03 14:43:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 787 transitions. [2025-03-03 14:43:37,565 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 787 transitions. Word has length 89 [2025-03-03 14:43:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:37,565 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 787 transitions. [2025-03-03 14:43:37,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 787 transitions. [2025-03-03 14:43:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:37,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:37,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:37,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:43:37,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:37,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash -368997242, now seen corresponding path program 1 times [2025-03-03 14:43:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:37,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517383853] [2025-03-03 14:43:37,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:37,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:37,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:37,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:37,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517383853] [2025-03-03 14:43:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517383853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606740607] [2025-03-03 14:43:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:37,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:37,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:37,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:37,690 INFO L87 Difference]: Start difference. First operand 532 states and 787 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:38,072 INFO L93 Difference]: Finished difference Result 1461 states and 2184 transitions. [2025-03-03 14:43:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:38,078 INFO L225 Difference]: With dead ends: 1461 [2025-03-03 14:43:38,078 INFO L226 Difference]: Without dead ends: 941 [2025-03-03 14:43:38,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:38,080 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 471 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:38,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1414 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-03 14:43:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 883. [2025-03-03 14:43:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 776 states have (on average 1.4871134020618557) internal successors, (1154), 783 states have internal predecessors, (1154), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-03 14:43:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1310 transitions. [2025-03-03 14:43:38,132 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1310 transitions. Word has length 89 [2025-03-03 14:43:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:38,133 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1310 transitions. [2025-03-03 14:43:38,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1310 transitions. [2025-03-03 14:43:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:38,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:38,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:38,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:43:38,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:38,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1324518521, now seen corresponding path program 1 times [2025-03-03 14:43:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53760456] [2025-03-03 14:43:38,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:38,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:38,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:38,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:38,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53760456] [2025-03-03 14:43:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53760456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:38,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013489202] [2025-03-03 14:43:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:38,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:38,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:38,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:38,274 INFO L87 Difference]: Start difference. First operand 883 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:38,687 INFO L93 Difference]: Finished difference Result 2554 states and 3837 transitions. [2025-03-03 14:43:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:38,698 INFO L225 Difference]: With dead ends: 2554 [2025-03-03 14:43:38,698 INFO L226 Difference]: Without dead ends: 1683 [2025-03-03 14:43:38,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:38,702 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 463 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:38,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1388 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2025-03-03 14:43:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1621. [2025-03-03 14:43:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1424 states have (on average 1.4915730337078652) internal successors, (2124), 1445 states have internal predecessors, (2124), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-03 14:43:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2432 transitions. [2025-03-03 14:43:38,809 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2432 transitions. Word has length 89 [2025-03-03 14:43:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:38,809 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 2432 transitions. [2025-03-03 14:43:38,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2432 transitions. [2025-03-03 14:43:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:38,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:38,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:38,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:43:38,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:38,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1808193848, now seen corresponding path program 1 times [2025-03-03 14:43:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047628043] [2025-03-03 14:43:38,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:38,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:38,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:38,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047628043] [2025-03-03 14:43:38,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047628043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:38,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343560353] [2025-03-03 14:43:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:38,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:38,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:38,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:38,936 INFO L87 Difference]: Start difference. First operand 1621 states and 2432 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:39,443 INFO L93 Difference]: Finished difference Result 5148 states and 7866 transitions. [2025-03-03 14:43:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:39,458 INFO L225 Difference]: With dead ends: 5148 [2025-03-03 14:43:39,459 INFO L226 Difference]: Without dead ends: 3539 [2025-03-03 14:43:39,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:39,463 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 592 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:39,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1363 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2025-03-03 14:43:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3172. [2025-03-03 14:43:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 2785 states have (on average 1.503770197486535) internal successors, (4188), 2852 states have internal predecessors, (4188), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-03 14:43:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4880 transitions. [2025-03-03 14:43:39,604 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4880 transitions. Word has length 89 [2025-03-03 14:43:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:39,605 INFO L471 AbstractCegarLoop]: Abstraction has 3172 states and 4880 transitions. [2025-03-03 14:43:39,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4880 transitions. [2025-03-03 14:43:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:39,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:39,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:43:39,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -853964953, now seen corresponding path program 1 times [2025-03-03 14:43:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863691095] [2025-03-03 14:43:39,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:39,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:39,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:39,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863691095] [2025-03-03 14:43:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863691095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:39,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:39,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:43:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177864176] [2025-03-03 14:43:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:39,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:43:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:39,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:43:39,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:43:39,701 INFO L87 Difference]: Start difference. First operand 3172 states and 4880 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:39,981 INFO L93 Difference]: Finished difference Result 6747 states and 10614 transitions. [2025-03-03 14:43:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:43:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:39,997 INFO L225 Difference]: With dead ends: 6747 [2025-03-03 14:43:39,997 INFO L226 Difference]: Without dead ends: 3587 [2025-03-03 14:43:40,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:40,005 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 352 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:40,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 490 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:43:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2025-03-03 14:43:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3172. [2025-03-03 14:43:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 2785 states have (on average 1.4976660682226213) internal successors, (4171), 2852 states have internal predecessors, (4171), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-03 14:43:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4863 transitions. [2025-03-03 14:43:40,157 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4863 transitions. Word has length 89 [2025-03-03 14:43:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:40,157 INFO L471 AbstractCegarLoop]: Abstraction has 3172 states and 4863 transitions. [2025-03-03 14:43:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4863 transitions. [2025-03-03 14:43:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:40,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:40,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:40,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:43:40,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1100278040, now seen corresponding path program 1 times [2025-03-03 14:43:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999136202] [2025-03-03 14:43:40,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:40,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:40,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:40,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999136202] [2025-03-03 14:43:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999136202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:40,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:40,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692978047] [2025-03-03 14:43:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:40,236 INFO L87 Difference]: Start difference. First operand 3172 states and 4863 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:40,796 INFO L93 Difference]: Finished difference Result 10013 states and 15781 transitions. [2025-03-03 14:43:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:40,827 INFO L225 Difference]: With dead ends: 10013 [2025-03-03 14:43:40,827 INFO L226 Difference]: Without dead ends: 6853 [2025-03-03 14:43:40,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:40,837 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 519 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:40,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1332 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6853 states. [2025-03-03 14:43:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6853 to 6412. [2025-03-03 14:43:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 5599 states have (on average 1.5040185747454902) internal successors, (8421), 5812 states have internal predecessors, (8421), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 14:43:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 10249 transitions. [2025-03-03 14:43:41,114 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 10249 transitions. Word has length 89 [2025-03-03 14:43:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:41,114 INFO L471 AbstractCegarLoop]: Abstraction has 6412 states and 10249 transitions. [2025-03-03 14:43:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 10249 transitions. [2025-03-03 14:43:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:41,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:41,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:41,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:43:41,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:41,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1524175687, now seen corresponding path program 1 times [2025-03-03 14:43:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:41,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120750445] [2025-03-03 14:43:41,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:41,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:41,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:41,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:41,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:41,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120750445] [2025-03-03 14:43:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120750445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:41,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:43:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443987382] [2025-03-03 14:43:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:41,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:43:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:41,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:43:41,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:43:41,176 INFO L87 Difference]: Start difference. First operand 6412 states and 10249 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:41,561 INFO L93 Difference]: Finished difference Result 13547 states and 22306 transitions. [2025-03-03 14:43:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:43:41,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:41,592 INFO L225 Difference]: With dead ends: 13547 [2025-03-03 14:43:41,593 INFO L226 Difference]: Without dead ends: 7147 [2025-03-03 14:43:41,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:41,606 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 341 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:41,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 494 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:43:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7147 states. [2025-03-03 14:43:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7147 to 6412. [2025-03-03 14:43:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 5599 states have (on average 1.4981246651187712) internal successors, (8388), 5812 states have internal predecessors, (8388), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 14:43:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 10216 transitions. [2025-03-03 14:43:41,972 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 10216 transitions. Word has length 89 [2025-03-03 14:43:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 6412 states and 10216 transitions. [2025-03-03 14:43:41,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 10216 transitions. [2025-03-03 14:43:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:41,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:41,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:41,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:43:41,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:41,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash 916098824, now seen corresponding path program 1 times [2025-03-03 14:43:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795652248] [2025-03-03 14:43:41,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:41,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795652248] [2025-03-03 14:43:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795652248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:42,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230000629] [2025-03-03 14:43:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:42,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:42,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:42,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:42,061 INFO L87 Difference]: Start difference. First operand 6412 states and 10216 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:42,842 INFO L93 Difference]: Finished difference Result 19745 states and 32986 transitions. [2025-03-03 14:43:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:42,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 89 [2025-03-03 14:43:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:42,895 INFO L225 Difference]: With dead ends: 19745 [2025-03-03 14:43:42,896 INFO L226 Difference]: Without dead ends: 13345 [2025-03-03 14:43:42,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:42,913 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 446 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:42,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1301 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13345 states. [2025-03-03 14:43:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13345 to 13006. [2025-03-03 14:43:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13006 states, 11195 states have (on average 1.4869138008039304) internal successors, (16646), 11862 states have internal predecessors, (16646), 754 states have call successors, (754), 390 states have call predecessors, (754), 1056 states have return successors, (4850), 817 states have call predecessors, (4850), 754 states have call successors, (4850) [2025-03-03 14:43:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13006 states to 13006 states and 22250 transitions. [2025-03-03 14:43:43,621 INFO L78 Accepts]: Start accepts. Automaton has 13006 states and 22250 transitions. Word has length 89 [2025-03-03 14:43:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:43,622 INFO L471 AbstractCegarLoop]: Abstraction has 13006 states and 22250 transitions. [2025-03-03 14:43:43,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 13006 states and 22250 transitions. [2025-03-03 14:43:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:43:43,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:43,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:43,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:43:43,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1597368537, now seen corresponding path program 1 times [2025-03-03 14:43:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920657629] [2025-03-03 14:43:43,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:43,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:43:43,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:43:43,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:43,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:43:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920657629] [2025-03-03 14:43:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920657629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:43,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:43,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:43:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676589798] [2025-03-03 14:43:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:43,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:43:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:43,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:43:43,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:43:43,689 INFO L87 Difference]: Start difference. First operand 13006 states and 22250 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:44,776 INFO L93 Difference]: Finished difference Result 38664 states and 66843 transitions. [2025-03-03 14:43:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:43:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-03-03 14:43:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:44,864 INFO L225 Difference]: With dead ends: 38664 [2025-03-03 14:43:44,864 INFO L226 Difference]: Without dead ends: 25671 [2025-03-03 14:43:44,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:43:44,907 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 469 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:44,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 949 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:43:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25671 states. [2025-03-03 14:43:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25671 to 25606. [2025-03-03 14:43:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25606 states, 21989 states have (on average 1.4719177770703533) internal successors, (32366), 23387 states have internal predecessors, (32366), 1504 states have call successors, (1504), 780 states have call predecessors, (1504), 2112 states have return successors, (9633), 1502 states have call predecessors, (9633), 1504 states have call successors, (9633) [2025-03-03 14:43:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25606 states to 25606 states and 43503 transitions. [2025-03-03 14:43:46,072 INFO L78 Accepts]: Start accepts. Automaton has 25606 states and 43503 transitions. Word has length 89 [2025-03-03 14:43:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:46,073 INFO L471 AbstractCegarLoop]: Abstraction has 25606 states and 43503 transitions. [2025-03-03 14:43:46,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:43:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25606 states and 43503 transitions. [2025-03-03 14:43:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:43:46,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:46,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:43:46,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1233605621, now seen corresponding path program 1 times [2025-03-03 14:43:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:46,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349460256] [2025-03-03 14:43:46,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:46,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:43:46,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:43:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:43:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349460256] [2025-03-03 14:43:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349460256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:46,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266015192] [2025-03-03 14:43:46,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:46,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:46,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:46,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:43:46,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:43:46,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:43:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:43:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:46,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:43:46,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:43:46,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:43:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266015192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:46,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:43:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 14:43:46,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042266809] [2025-03-03 14:43:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:46,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:46,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:46,361 INFO L87 Difference]: Start difference. First operand 25606 states and 43503 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:48,520 INFO L93 Difference]: Finished difference Result 76141 states and 130083 transitions. [2025-03-03 14:43:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 147 [2025-03-03 14:43:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:48,708 INFO L225 Difference]: With dead ends: 76141 [2025-03-03 14:43:48,708 INFO L226 Difference]: Without dead ends: 50548 [2025-03-03 14:43:48,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:48,775 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 224 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:48,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 514 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50548 states. [2025-03-03 14:43:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50548 to 50156. [2025-03-03 14:43:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50156 states, 43057 states have (on average 1.4728383305850385) internal successors, (63416), 45852 states have internal predecessors, (63416), 2874 states have call successors, (2874), 1560 states have call predecessors, (2874), 4224 states have return successors, (19069), 2807 states have call predecessors, (19069), 2874 states have call successors, (19069) [2025-03-03 14:43:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50156 states to 50156 states and 85359 transitions. [2025-03-03 14:43:51,087 INFO L78 Accepts]: Start accepts. Automaton has 50156 states and 85359 transitions. Word has length 147 [2025-03-03 14:43:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:51,087 INFO L471 AbstractCegarLoop]: Abstraction has 50156 states and 85359 transitions. [2025-03-03 14:43:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 50156 states and 85359 transitions. [2025-03-03 14:43:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:43:51,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:51,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:51,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:43:51,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:43:51,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:51,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash -230613743, now seen corresponding path program 1 times [2025-03-03 14:43:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720463166] [2025-03-03 14:43:51,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:51,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:43:51,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:43:51,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:43:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720463166] [2025-03-03 14:43:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720463166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56868751] [2025-03-03 14:43:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:51,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:43:51,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:43:51,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:43:51,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:43:51,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:51,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:51,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:43:51,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:43:51,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:43:51,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56868751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:51,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:43:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 14:43:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269195896] [2025-03-03 14:43:51,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:51,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:51,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:51,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:51,587 INFO L87 Difference]: Start difference. First operand 50156 states and 85359 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:55,733 INFO L93 Difference]: Finished difference Result 149525 states and 255841 transitions. [2025-03-03 14:43:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 147 [2025-03-03 14:43:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:56,084 INFO L225 Difference]: With dead ends: 149525 [2025-03-03 14:43:56,084 INFO L226 Difference]: Without dead ends: 99382 [2025-03-03 14:43:56,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:56,198 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 218 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:56,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 514 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99382 states. [2025-03-03 14:44:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99382 to 98600. [2025-03-03 14:44:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98600 states, 84539 states have (on average 1.472361868486734) internal successors, (124472), 90128 states have internal predecessors, (124472), 5612 states have call successors, (5612), 3120 states have call predecessors, (5612), 8448 states have return successors, (37939), 5415 states have call predecessors, (37939), 5612 states have call successors, (37939) [2025-03-03 14:44:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98600 states to 98600 states and 168023 transitions. [2025-03-03 14:44:01,141 INFO L78 Accepts]: Start accepts. Automaton has 98600 states and 168023 transitions. Word has length 147 [2025-03-03 14:44:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:01,142 INFO L471 AbstractCegarLoop]: Abstraction has 98600 states and 168023 transitions. [2025-03-03 14:44:01,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:44:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 98600 states and 168023 transitions. [2025-03-03 14:44:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:44:01,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:01,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:01,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:44:01,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:44:01,422 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:01,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash 89934487, now seen corresponding path program 1 times [2025-03-03 14:44:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:01,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432644756] [2025-03-03 14:44:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:44:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:44:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:01,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:44:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432644756] [2025-03-03 14:44:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432644756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:44:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618580826] [2025-03-03 14:44:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:01,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:44:01,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:44:01,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:44:01,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:44:01,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:44:01,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:44:01,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:01,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:01,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:44:01,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:44:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:44:01,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:44:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618580826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:01,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:44:01,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 14:44:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557544668] [2025-03-03 14:44:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:01,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:01,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:01,653 INFO L87 Difference]: Start difference. First operand 98600 states and 168023 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)