./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/eca-rers2012/Problem03_label54.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 83b9baf9f6deb0db64cb6e97ea77e31e0e6aa56bc46a9ba9c0c02a0377225524 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:12:11,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:12:11,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:12:11,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:12:11,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:12:11,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:12:11,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:12:11,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:12:11,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:12:11,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:12:11,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:12:11,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:12:11,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:12:11,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:12:11,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:12:11,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:12:11,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:12:11,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:12:11,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:12:11,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:12:11,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:12:11,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:12:11,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:12:11,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:12:11,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:12:11,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:12:11,682 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 -> 83b9baf9f6deb0db64cb6e97ea77e31e0e6aa56bc46a9ba9c0c02a0377225524 [2025-03-16 14:12:11,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:12:11,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:12:11,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:12:11,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:12:11,911 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:12:11,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label54.c [2025-03-16 14:12:13,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9a22344/98d00008702a4480885b8765b93d9e66/FLAG6406a7d60 [2025-03-16 14:12:13,445 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:12:13,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label54.c [2025-03-16 14:12:13,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9a22344/98d00008702a4480885b8765b93d9e66/FLAG6406a7d60 [2025-03-16 14:12:13,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9a22344/98d00008702a4480885b8765b93d9e66 [2025-03-16 14:12:13,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:12:13,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:12:13,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:12:13,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:12:13,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:12:13,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:12:13" (1/1) ... [2025-03-16 14:12:13,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b9192b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:13, skipping insertion in model container [2025-03-16 14:12:13,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:12:13" (1/1) ... [2025-03-16 14:12:13,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:12:14,030 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/eca-rers2012/Problem03_label54.c[56627,56640] [2025-03-16 14:12:14,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:12:14,063 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:12:14,170 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/eca-rers2012/Problem03_label54.c[56627,56640] [2025-03-16 14:12:14,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:12:14,206 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:12:14,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14 WrapperNode [2025-03-16 14:12:14,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:12:14,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:12:14,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:12:14,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:12:14,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,342 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:12:14,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:12:14,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:12:14,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:12:14,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:12:14,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,395 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-16 14:12:14,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:12:14,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:12:14,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:12:14,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:12:14,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (1/1) ... [2025-03-16 14:12:14,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:12:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:14,495 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-16 14:12:14,498 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-16 14:12:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:12:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:12:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:12:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:12:14,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:12:14,573 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:12:15,850 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:12:15,850 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:12:15,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:12:15,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:12:15,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:15 BoogieIcfgContainer [2025-03-16 14:12:15,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:12:15,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:12:15,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:12:15,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:12:15,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:12:13" (1/3) ... [2025-03-16 14:12:15,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bf2a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:15, skipping insertion in model container [2025-03-16 14:12:15,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:12:14" (2/3) ... [2025-03-16 14:12:15,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bf2a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:12:15, skipping insertion in model container [2025-03-16 14:12:15,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:15" (3/3) ... [2025-03-16 14:12:15,872 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label54.c [2025-03-16 14:12:15,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:12:15,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label54.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:12:15,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:12:15,949 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;@77deaaad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:12:15,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:12:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 14:12:15,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:15,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:15,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:15,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1184695472, now seen corresponding path program 1 times [2025-03-16 14:12:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:15,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342476152] [2025-03-16 14:12:15,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:16,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 14:12:16,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 14:12:16,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:16,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:16,428 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-16 14:12:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342476152] [2025-03-16 14:12:16,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342476152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:16,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:16,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121106288] [2025-03-16 14:12:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:16,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:12:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:16,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:12:16,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:12:16,457 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:16,492 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:12:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:12:16,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-16 14:12:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:16,501 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:12:16,502 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:12:16,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:12:16,508 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:16,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:12:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:12:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:12:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:12:16,557 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 165 [2025-03-16 14:12:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:16,558 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:12:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:12:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 14:12:16,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:16,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:16,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:12:16,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:16,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1175194096, now seen corresponding path program 1 times [2025-03-16 14:12:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:16,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876370713] [2025-03-16 14:12:16,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:16,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 14:12:16,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 14:12:16,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:16,988 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-16 14:12:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876370713] [2025-03-16 14:12:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876370713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:16,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:16,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813709929] [2025-03-16 14:12:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:16,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:16,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:16,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:16,993 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:17,705 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2025-03-16 14:12:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-16 14:12:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:17,710 INFO L225 Difference]: With dead ends: 698 [2025-03-16 14:12:17,712 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 14:12:17,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:17,714 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 90 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:17,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 149 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 14:12:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-16 14:12:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2025-03-16 14:12:17,739 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 165 [2025-03-16 14:12:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:17,739 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2025-03-16 14:12:17,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2025-03-16 14:12:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 14:12:17,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:17,741 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:12:17,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:17,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1635378910, now seen corresponding path program 1 times [2025-03-16 14:12:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:17,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370882681] [2025-03-16 14:12:17,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:17,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 14:12:17,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 14:12:17,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:17,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370882681] [2025-03-16 14:12:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370882681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:17,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777758962] [2025-03-16 14:12:17,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:17,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:17,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:17,931 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:18,563 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2025-03-16 14:12:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-03-16 14:12:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:18,569 INFO L225 Difference]: With dead ends: 1343 [2025-03-16 14:12:18,569 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:12:18,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:18,571 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:18,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:12:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2025-03-16 14:12:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.512672811059908) internal successors, (1313), 868 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1313 transitions. [2025-03-16 14:12:18,590 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1313 transitions. Word has length 173 [2025-03-16 14:12:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:18,590 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1313 transitions. [2025-03-16 14:12:18,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1313 transitions. [2025-03-16 14:12:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 14:12:18,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:18,594 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:18,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:12:18,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:18,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2095990595, now seen corresponding path program 1 times [2025-03-16 14:12:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551793712] [2025-03-16 14:12:18,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:18,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 14:12:18,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 14:12:18,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:18,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:12:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:18,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551793712] [2025-03-16 14:12:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551793712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635445624] [2025-03-16 14:12:18,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:18,892 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-16 14:12:18,893 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-16 14:12:18,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 14:12:19,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 14:12:19,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:19,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:19,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:19,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:12:19,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635445624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:12:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719683237] [2025-03-16 14:12:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:19,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:19,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:19,065 INFO L87 Difference]: Start difference. First operand 869 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:19,280 INFO L93 Difference]: Finished difference Result 2600 states and 3932 transitions. [2025-03-16 14:12:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:19,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-03-16 14:12:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:19,287 INFO L225 Difference]: With dead ends: 2600 [2025-03-16 14:12:19,288 INFO L226 Difference]: Without dead ends: 1732 [2025-03-16 14:12:19,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:19,292 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 360 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:19,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 600 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:12:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-16 14:12:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1728. [2025-03-16 14:12:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.5130283729009844) internal successors, (2613), 1727 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2613 transitions. [2025-03-16 14:12:19,340 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2613 transitions. Word has length 185 [2025-03-16 14:12:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2613 transitions. [2025-03-16 14:12:19,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2613 transitions. [2025-03-16 14:12:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 14:12:19,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:19,346 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:19,355 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-16 14:12:19,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:19,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:19,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash -407790306, now seen corresponding path program 1 times [2025-03-16 14:12:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308063136] [2025-03-16 14:12:19,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:19,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:12:19,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:12:19,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:19,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:19,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308063136] [2025-03-16 14:12:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308063136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651966423] [2025-03-16 14:12:19,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:19,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:19,769 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-16 14:12:19,770 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-16 14:12:19,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:12:19,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:12:19,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:19,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:19,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:19,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:19,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:19,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651966423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:19,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:12:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945222155] [2025-03-16 14:12:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:19,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:19,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:19,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:19,899 INFO L87 Difference]: Start difference. First operand 1728 states and 2613 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:20,603 INFO L93 Difference]: Finished difference Result 5087 states and 7709 transitions. [2025-03-16 14:12:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2025-03-16 14:12:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:20,615 INFO L225 Difference]: With dead ends: 5087 [2025-03-16 14:12:20,615 INFO L226 Difference]: Without dead ends: 3360 [2025-03-16 14:12:20,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:20,619 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 230 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:20,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 414 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2025-03-16 14:12:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3356. [2025-03-16 14:12:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3355 states have (on average 1.336214605067064) internal successors, (4483), 3355 states have internal predecessors, (4483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4483 transitions. [2025-03-16 14:12:20,698 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4483 transitions. Word has length 187 [2025-03-16 14:12:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:20,698 INFO L471 AbstractCegarLoop]: Abstraction has 3356 states and 4483 transitions. [2025-03-16 14:12:20,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4483 transitions. [2025-03-16 14:12:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 14:12:20,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:20,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:20,710 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-16 14:12:20,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:20,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:20,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash -811865853, now seen corresponding path program 1 times [2025-03-16 14:12:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440627008] [2025-03-16 14:12:20,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:20,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:12:20,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:12:20,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:20,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:21,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:21,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440627008] [2025-03-16 14:12:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440627008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:21,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:21,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122778385] [2025-03-16 14:12:21,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:21,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:21,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:21,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:21,058 INFO L87 Difference]: Start difference. First operand 3356 states and 4483 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:21,718 INFO L93 Difference]: Finished difference Result 9984 states and 13341 transitions. [2025-03-16 14:12:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-16 14:12:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:21,740 INFO L225 Difference]: With dead ends: 9984 [2025-03-16 14:12:21,740 INFO L226 Difference]: Without dead ends: 6629 [2025-03-16 14:12:21,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:21,745 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:21,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 173 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states. [2025-03-16 14:12:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 6625. [2025-03-16 14:12:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 6624 states have (on average 1.2844202898550725) internal successors, (8508), 6624 states have internal predecessors, (8508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 8508 transitions. [2025-03-16 14:12:21,877 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 8508 transitions. Word has length 188 [2025-03-16 14:12:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:21,877 INFO L471 AbstractCegarLoop]: Abstraction has 6625 states and 8508 transitions. [2025-03-16 14:12:21,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 8508 transitions. [2025-03-16 14:12:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 14:12:21,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:21,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:21,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:12:21,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1395251260, now seen corresponding path program 1 times [2025-03-16 14:12:21,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:21,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524691129] [2025-03-16 14:12:21,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:21,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 14:12:21,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 14:12:21,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:21,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 14:12:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524691129] [2025-03-16 14:12:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524691129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:21,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:21,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22018699] [2025-03-16 14:12:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:21,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:21,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:21,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:21,985 INFO L87 Difference]: Start difference. First operand 6625 states and 8508 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:22,370 INFO L93 Difference]: Finished difference Result 13185 states and 16929 transitions. [2025-03-16 14:12:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-16 14:12:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:22,391 INFO L225 Difference]: With dead ends: 13185 [2025-03-16 14:12:22,392 INFO L226 Difference]: Without dead ends: 6561 [2025-03-16 14:12:22,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:22,399 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:22,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:12:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2025-03-16 14:12:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 6561. [2025-03-16 14:12:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 1.2557926829268293) internal successors, (8238), 6560 states have internal predecessors, (8238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 8238 transitions. [2025-03-16 14:12:22,537 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 8238 transitions. Word has length 200 [2025-03-16 14:12:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 6561 states and 8238 transitions. [2025-03-16 14:12:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 8238 transitions. [2025-03-16 14:12:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 14:12:22,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:22,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:22,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:12:22,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1679726349, now seen corresponding path program 1 times [2025-03-16 14:12:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999012058] [2025-03-16 14:12:22,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:22,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 14:12:22,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 14:12:22,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:22,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999012058] [2025-03-16 14:12:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999012058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:22,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:22,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:22,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414067393] [2025-03-16 14:12:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:22,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:22,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:22,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:22,767 INFO L87 Difference]: Start difference. First operand 6561 states and 8238 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:23,377 INFO L93 Difference]: Finished difference Result 16393 states and 20523 transitions. [2025-03-16 14:12:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-16 14:12:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:23,406 INFO L225 Difference]: With dead ends: 16393 [2025-03-16 14:12:23,406 INFO L226 Difference]: Without dead ends: 9833 [2025-03-16 14:12:23,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:23,416 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:23,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 105 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9833 states. [2025-03-16 14:12:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9833 to 9831. [2025-03-16 14:12:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9831 states, 9830 states have (on average 1.2396744659206511) internal successors, (12186), 9830 states have internal predecessors, (12186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9831 states to 9831 states and 12186 transitions. [2025-03-16 14:12:23,581 INFO L78 Accepts]: Start accepts. Automaton has 9831 states and 12186 transitions. Word has length 206 [2025-03-16 14:12:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 9831 states and 12186 transitions. [2025-03-16 14:12:23,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 9831 states and 12186 transitions. [2025-03-16 14:12:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 14:12:23,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:23,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:12:23,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1300157322, now seen corresponding path program 1 times [2025-03-16 14:12:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576598134] [2025-03-16 14:12:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:23,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 14:12:23,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 14:12:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576598134] [2025-03-16 14:12:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576598134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858887636] [2025-03-16 14:12:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:23,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:23,940 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-16 14:12:23,941 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-16 14:12:24,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 14:12:24,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 14:12:24,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:24,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:24,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:24,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:24,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:24,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858887636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:24,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:24,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:24,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344222159] [2025-03-16 14:12:24,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:24,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:24,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:24,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:24,249 INFO L87 Difference]: Start difference. First operand 9831 states and 12186 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:24,849 INFO L93 Difference]: Finished difference Result 28619 states and 35523 transitions. [2025-03-16 14:12:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:24,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-03-16 14:12:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:24,879 INFO L225 Difference]: With dead ends: 28619 [2025-03-16 14:12:24,880 INFO L226 Difference]: Without dead ends: 18789 [2025-03-16 14:12:24,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:24,894 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 71 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:24,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 352 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18789 states. [2025-03-16 14:12:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18789 to 18779. [2025-03-16 14:12:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.2087549259772075) internal successors, (22698), 18778 states have internal predecessors, (22698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 22698 transitions. [2025-03-16 14:12:25,189 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 22698 transitions. Word has length 213 [2025-03-16 14:12:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 22698 transitions. [2025-03-16 14:12:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 22698 transitions. [2025-03-16 14:12:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:12:25,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:25,209 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:25,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:25,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:25,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:25,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2051978830, now seen corresponding path program 1 times [2025-03-16 14:12:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:25,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702304335] [2025-03-16 14:12:25,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:25,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:12:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:12:25,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:25,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:12:25,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:25,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702304335] [2025-03-16 14:12:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702304335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:25,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767470085] [2025-03-16 14:12:25,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:25,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:25,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:25,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:25,580 INFO L87 Difference]: Start difference. First operand 18779 states and 22698 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:26,289 INFO L93 Difference]: Finished difference Result 45068 states and 55535 transitions. [2025-03-16 14:12:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-03-16 14:12:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:26,331 INFO L225 Difference]: With dead ends: 45068 [2025-03-16 14:12:26,332 INFO L226 Difference]: Without dead ends: 26290 [2025-03-16 14:12:26,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:26,351 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 213 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:26,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 147 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26290 states. [2025-03-16 14:12:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26290 to 26290. [2025-03-16 14:12:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26290 states, 26289 states have (on average 1.1729620753927499) internal successors, (30836), 26289 states have internal predecessors, (30836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26290 states to 26290 states and 30836 transitions. [2025-03-16 14:12:26,812 INFO L78 Accepts]: Start accepts. Automaton has 26290 states and 30836 transitions. Word has length 226 [2025-03-16 14:12:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:26,812 INFO L471 AbstractCegarLoop]: Abstraction has 26290 states and 30836 transitions. [2025-03-16 14:12:26,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 26290 states and 30836 transitions. [2025-03-16 14:12:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-16 14:12:26,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:26,838 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:12:26,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 724796047, now seen corresponding path program 1 times [2025-03-16 14:12:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102325569] [2025-03-16 14:12:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:26,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-16 14:12:26,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-16 14:12:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:26,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102325569] [2025-03-16 14:12:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102325569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451394922] [2025-03-16 14:12:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:27,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:27,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:27,020 INFO L87 Difference]: Start difference. First operand 26290 states and 30836 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:27,668 INFO L93 Difference]: Finished difference Result 66622 states and 78694 transitions. [2025-03-16 14:12:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2025-03-16 14:12:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:27,824 INFO L225 Difference]: With dead ends: 66622 [2025-03-16 14:12:27,824 INFO L226 Difference]: Without dead ends: 40333 [2025-03-16 14:12:27,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:27,837 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 63 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:27,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 324 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40333 states. [2025-03-16 14:12:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40333 to 40297. [2025-03-16 14:12:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40297 states, 40296 states have (on average 1.172002183839587) internal successors, (47227), 40296 states have internal predecessors, (47227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40297 states to 40297 states and 47227 transitions. [2025-03-16 14:12:28,320 INFO L78 Accepts]: Start accepts. Automaton has 40297 states and 47227 transitions. Word has length 239 [2025-03-16 14:12:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 40297 states and 47227 transitions. [2025-03-16 14:12:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40297 states and 47227 transitions. [2025-03-16 14:12:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 14:12:28,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:28,344 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:28,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:12:28,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:28,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1257657517, now seen corresponding path program 1 times [2025-03-16 14:12:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:28,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687132412] [2025-03-16 14:12:28,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:28,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 14:12:28,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 14:12:28,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:12:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687132412] [2025-03-16 14:12:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687132412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002794760] [2025-03-16 14:12:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:28,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:28,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:28,505 INFO L87 Difference]: Start difference. First operand 40297 states and 47227 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:29,329 INFO L93 Difference]: Finished difference Result 102380 states and 119860 transitions. [2025-03-16 14:12:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2025-03-16 14:12:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:29,412 INFO L225 Difference]: With dead ends: 102380 [2025-03-16 14:12:29,412 INFO L226 Difference]: Without dead ends: 62084 [2025-03-16 14:12:29,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:29,448 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:29,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 151 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62084 states. [2025-03-16 14:12:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62084 to 61672. [2025-03-16 14:12:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61672 states, 61671 states have (on average 1.1690746055682573) internal successors, (72098), 61671 states have internal predecessors, (72098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61672 states to 61672 states and 72098 transitions. [2025-03-16 14:12:30,598 INFO L78 Accepts]: Start accepts. Automaton has 61672 states and 72098 transitions. Word has length 253 [2025-03-16 14:12:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:30,598 INFO L471 AbstractCegarLoop]: Abstraction has 61672 states and 72098 transitions. [2025-03-16 14:12:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61672 states and 72098 transitions. [2025-03-16 14:12:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 14:12:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:30,627 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:12:30,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1418222960, now seen corresponding path program 2 times [2025-03-16 14:12:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893011045] [2025-03-16 14:12:30,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:12:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:30,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 260 statements into 2 equivalence classes. [2025-03-16 14:12:30,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 14:12:30,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:12:30,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 14:12:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893011045] [2025-03-16 14:12:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893011045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:30,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661562634] [2025-03-16 14:12:30,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:30,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:30,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:30,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:30,782 INFO L87 Difference]: Start difference. First operand 61672 states and 72098 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:31,427 INFO L93 Difference]: Finished difference Result 117419 states and 136592 transitions. [2025-03-16 14:12:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-03-16 14:12:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:31,496 INFO L225 Difference]: With dead ends: 117419 [2025-03-16 14:12:31,496 INFO L226 Difference]: Without dead ends: 55748 [2025-03-16 14:12:31,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:31,536 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 94 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:31,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 331 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55748 states. [2025-03-16 14:12:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55748 to 55741. [2025-03-16 14:12:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55741 states, 55740 states have (on average 1.1270541801219949) internal successors, (62822), 55740 states have internal predecessors, (62822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55741 states to 55741 states and 62822 transitions. [2025-03-16 14:12:32,344 INFO L78 Accepts]: Start accepts. Automaton has 55741 states and 62822 transitions. Word has length 260 [2025-03-16 14:12:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:32,344 INFO L471 AbstractCegarLoop]: Abstraction has 55741 states and 62822 transitions. [2025-03-16 14:12:32,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 55741 states and 62822 transitions. [2025-03-16 14:12:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 14:12:32,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:32,373 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:32,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:12:32,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:32,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1751973669, now seen corresponding path program 1 times [2025-03-16 14:12:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:32,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258401999] [2025-03-16 14:12:32,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:32,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 14:12:32,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 14:12:32,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:32,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 14:12:33,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:33,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258401999] [2025-03-16 14:12:33,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258401999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:33,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251170577] [2025-03-16 14:12:33,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:33,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:33,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:33,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:12:33,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 14:12:33,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 14:12:33,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:33,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:33,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:33,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 14:12:33,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:33,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251170577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:33,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:33,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 14:12:33,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017569569] [2025-03-16 14:12:33,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:33,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:33,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:33,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:33,508 INFO L87 Difference]: Start difference. First operand 55741 states and 62822 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:34,223 INFO L93 Difference]: Finished difference Result 111516 states and 125706 transitions. [2025-03-16 14:12:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-03-16 14:12:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:34,296 INFO L225 Difference]: With dead ends: 111516 [2025-03-16 14:12:34,297 INFO L226 Difference]: Without dead ends: 55776 [2025-03-16 14:12:34,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 265 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-16 14:12:34,340 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 154 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:34,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 157 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55776 states. [2025-03-16 14:12:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55776 to 55741. [2025-03-16 14:12:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55741 states, 55740 states have (on average 1.1245066379619664) internal successors, (62680), 55740 states have internal predecessors, (62680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55741 states to 55741 states and 62680 transitions. [2025-03-16 14:12:35,197 INFO L78 Accepts]: Start accepts. Automaton has 55741 states and 62680 transitions. Word has length 266 [2025-03-16 14:12:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:35,197 INFO L471 AbstractCegarLoop]: Abstraction has 55741 states and 62680 transitions. [2025-03-16 14:12:35,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55741 states and 62680 transitions. [2025-03-16 14:12:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-16 14:12:35,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:35,230 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:35,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:12:35,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:35,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:35,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2047509795, now seen corresponding path program 1 times [2025-03-16 14:12:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078558844] [2025-03-16 14:12:35,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:35,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-16 14:12:35,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-16 14:12:35,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:35,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:12:35,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078558844] [2025-03-16 14:12:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078558844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:35,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:35,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:35,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524275325] [2025-03-16 14:12:35,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:35,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:12:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:35,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:12:35,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:35,784 INFO L87 Difference]: Start difference. First operand 55741 states and 62680 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:36,629 INFO L93 Difference]: Finished difference Result 114763 states and 129005 transitions. [2025-03-16 14:12:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:12:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2025-03-16 14:12:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:36,688 INFO L225 Difference]: With dead ends: 114763 [2025-03-16 14:12:36,689 INFO L226 Difference]: Without dead ends: 59023 [2025-03-16 14:12:36,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:36,725 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 472 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:36,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 81 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59023 states. [2025-03-16 14:12:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59023 to 58989. [2025-03-16 14:12:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58989 states, 58988 states have (on average 1.1056316538957076) internal successors, (65219), 58988 states have internal predecessors, (65219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58989 states to 58989 states and 65219 transitions. [2025-03-16 14:12:37,341 INFO L78 Accepts]: Start accepts. Automaton has 58989 states and 65219 transitions. Word has length 280 [2025-03-16 14:12:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:37,342 INFO L471 AbstractCegarLoop]: Abstraction has 58989 states and 65219 transitions. [2025-03-16 14:12:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 58989 states and 65219 transitions. [2025-03-16 14:12:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-16 14:12:37,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:37,366 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:37,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:12:37,367 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1959429305, now seen corresponding path program 1 times [2025-03-16 14:12:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425485894] [2025-03-16 14:12:37,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:37,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-16 14:12:37,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-16 14:12:37,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:37,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-16 14:12:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425485894] [2025-03-16 14:12:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425485894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31205050] [2025-03-16 14:12:37,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:37,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:37,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:37,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:12:37,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-16 14:12:37,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-16 14:12:37,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:37,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:37,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:37,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-16 14:12:37,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:37,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31205050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:37,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:37,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706550667] [2025-03-16 14:12:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:37,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:37,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:37,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:37,890 INFO L87 Difference]: Start difference. First operand 58989 states and 65219 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:38,526 INFO L93 Difference]: Finished difference Result 117580 states and 130028 transitions. [2025-03-16 14:12:38,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:38,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 292 [2025-03-16 14:12:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:38,591 INFO L225 Difference]: With dead ends: 117580 [2025-03-16 14:12:38,591 INFO L226 Difference]: Without dead ends: 58592 [2025-03-16 14:12:38,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:38,623 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 251 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:38,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 288 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58592 states. [2025-03-16 14:12:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58592 to 58583. [2025-03-16 14:12:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58583 states, 58582 states have (on average 1.1020620668464716) internal successors, (64561), 58582 states have internal predecessors, (64561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58583 states to 58583 states and 64561 transitions. [2025-03-16 14:12:39,356 INFO L78 Accepts]: Start accepts. Automaton has 58583 states and 64561 transitions. Word has length 292 [2025-03-16 14:12:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:39,356 INFO L471 AbstractCegarLoop]: Abstraction has 58583 states and 64561 transitions. [2025-03-16 14:12:39,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 58583 states and 64561 transitions. [2025-03-16 14:12:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-16 14:12:39,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:39,386 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:12:39,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:39,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 14:12:39,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1561184394, now seen corresponding path program 1 times [2025-03-16 14:12:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500484133] [2025-03-16 14:12:39,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:39,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-16 14:12:39,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-16 14:12:39,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:39,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 122 proven. 6 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-16 14:12:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500484133] [2025-03-16 14:12:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500484133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163387566] [2025-03-16 14:12:39,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:39,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:39,989 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:39,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:12:40,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-16 14:12:40,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-16 14:12:40,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:40,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 14:12:40,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163387566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040051074] [2025-03-16 14:12:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:40,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:40,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:40,164 INFO L87 Difference]: Start difference. First operand 58583 states and 64561 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:40,576 INFO L93 Difference]: Finished difference Result 163300 states and 179880 transitions. [2025-03-16 14:12:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2025-03-16 14:12:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:40,691 INFO L225 Difference]: With dead ends: 163300 [2025-03-16 14:12:40,691 INFO L226 Difference]: Without dead ends: 104718 [2025-03-16 14:12:40,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:40,742 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 290 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:40,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 841 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:12:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104718 states. [2025-03-16 14:12:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104718 to 104714. [2025-03-16 14:12:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104714 states, 104713 states have (on average 1.0925482031839409) internal successors, (114404), 104713 states have internal predecessors, (114404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104714 states to 104714 states and 114404 transitions. [2025-03-16 14:12:42,272 INFO L78 Accepts]: Start accepts. Automaton has 104714 states and 114404 transitions. Word has length 362 [2025-03-16 14:12:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:42,272 INFO L471 AbstractCegarLoop]: Abstraction has 104714 states and 114404 transitions. [2025-03-16 14:12:42,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 104714 states and 114404 transitions. [2025-03-16 14:12:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-16 14:12:42,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:42,357 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:42,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:42,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 14:12:42,557 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:42,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash 790985808, now seen corresponding path program 1 times [2025-03-16 14:12:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931469044] [2025-03-16 14:12:42,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:42,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:42,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-16 14:12:42,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-16 14:12:42,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:42,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 115 proven. 6 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-16 14:12:43,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931469044] [2025-03-16 14:12:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931469044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539292960] [2025-03-16 14:12:43,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:43,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:43,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:12:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-16 14:12:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-16 14:12:43,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:43,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:43,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:43,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-16 14:12:43,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539292960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263191453] [2025-03-16 14:12:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:43,205 INFO L87 Difference]: Start difference. First operand 104714 states and 114404 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:44,080 INFO L93 Difference]: Finished difference Result 203936 states and 222751 transitions. [2025-03-16 14:12:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2025-03-16 14:12:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:44,083 INFO L225 Difference]: With dead ends: 203936 [2025-03-16 14:12:44,083 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:12:44,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:44,156 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 242 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:44,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 307 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:12:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:12:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:12:44,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 377 [2025-03-16 14:12:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:44,158 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:12:44,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:12:44,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:12:44,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:12:44,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 14:12:44,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:44,364 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:44,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:12:49,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:12:50,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:12:50 BoogieIcfgContainer [2025-03-16 14:12:50,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:12:50,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:12:50,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:12:50,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:12:50,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:12:15" (3/4) ... [2025-03-16 14:12:50,020 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:12:50,049 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:12:50,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:12:50,053 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:12:50,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:12:50,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:12:50,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:12:50,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:12:50,190 INFO L158 Benchmark]: Toolchain (without parser) took 36591.63ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 100.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-16 14:12:50,192 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:12:50,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.15ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 42.3MB in the end (delta: 57.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 14:12:50,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.16ms. Allocated memory is still 142.6MB. Free memory was 42.3MB in the beginning and 91.5MB in the end (delta: -49.2MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2025-03-16 14:12:50,192 INFO L158 Benchmark]: Boogie Preprocessor took 121.20ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 81.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:12:50,192 INFO L158 Benchmark]: IcfgBuilder took 1398.70ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 81.3MB in the beginning and 206.5MB in the end (delta: -125.2MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-03-16 14:12:50,193 INFO L158 Benchmark]: TraceAbstraction took 34150.85ms. Allocated memory was 310.4MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 206.5MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2025-03-16 14:12:50,193 INFO L158 Benchmark]: Witness Printer took 170.74ms. Allocated memory is still 3.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:12:50,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.15ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 42.3MB in the end (delta: 57.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.16ms. Allocated memory is still 142.6MB. Free memory was 42.3MB in the beginning and 91.5MB in the end (delta: -49.2MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.20ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 81.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1398.70ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 81.3MB in the beginning and 206.5MB in the end (delta: -125.2MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 34150.85ms. Allocated memory was 310.4MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 206.5MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 170.74ms. Allocated memory is still 3.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1543]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 241 locations, 457 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3692 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3692 mSDsluCounter, 4937 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 834 mSDsCounter, 1738 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8991 IncrementalHoareTripleChecker+Invalid, 10729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1738 mSolverCounterUnsat, 4103 mSDtfsCounter, 8991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1924 GetRequests, 1891 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104714occurred in iteration=17, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 579 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 6119 NumberOfCodeBlocks, 6119 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6094 ConstructedInterpolants, 0 QuantifiedInterpolants, 12673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3860 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 3146/3198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Location Invariant Derived location invariant: (((((((((((((((((((((((((a5 == 1) && (a3 <= 0)) && (a26 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) || (((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0))) || ((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a26 <= 0)) && (a11 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 <= 0))) || (((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || (((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a10 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:12:50,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE