./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label52.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 dadc4a7f56d2eeb12d7009442a875d9c494d437949017438f5005c98bfcd0bea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:52:43,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:52:43,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:52:43,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:52:43,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:52:43,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:52:43,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:52:43,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:52:43,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:52:43,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:52:43,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:52:43,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:52:43,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:52:43,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:52:43,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:52:43,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:52:43,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:52:43,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:52:43,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:52:43,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:52:43,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:52:43,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:52:43,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:52:43,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:52:43,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:52:43,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:52:43,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:52:43,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:52:43,702 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 -> dadc4a7f56d2eeb12d7009442a875d9c494d437949017438f5005c98bfcd0bea [2025-03-03 09:52:43,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:52:43,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:52:43,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:52:43,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:52:43,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:52:43,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label52.c [2025-03-03 09:52:45,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a53e2269/0b67c984eca44a12955d4a02dab8ddfd/FLAG63a0b9f0e [2025-03-03 09:52:45,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:52:45,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label52.c [2025-03-03 09:52:45,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a53e2269/0b67c984eca44a12955d4a02dab8ddfd/FLAG63a0b9f0e [2025-03-03 09:52:45,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a53e2269/0b67c984eca44a12955d4a02dab8ddfd [2025-03-03 09:52:45,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:52:45,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:52:45,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:52:45,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:52:45,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:52:45,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:52:45" (1/1) ... [2025-03-03 09:52:45,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ce49fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:45, skipping insertion in model container [2025-03-03 09:52:45,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:52:45" (1/1) ... [2025-03-03 09:52:45,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:52:46,001 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_label52.c[53923,53936] [2025-03-03 09:52:46,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:52:46,038 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:52:46,161 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_label52.c[53923,53936] [2025-03-03 09:52:46,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:52:46,197 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:52:46,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46 WrapperNode [2025-03-03 09:52:46,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:52:46,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:52:46,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:52:46,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:52:46,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,295 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:52:46,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:52:46,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:52:46,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:52:46,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:52:46,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,348 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:52:46,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:52:46,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:52:46,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:52:46,416 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:52:46,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (1/1) ... [2025-03-03 09:52:46,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:52:46,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:46,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:52:46,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:52:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:52:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:52:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:52:46,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:52:46,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:52:46,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:52:47,982 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:52:47,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:52:47,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:52:47,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:52:47,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:52:47 BoogieIcfgContainer [2025-03-03 09:52:47,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:52:47,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:52:47,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:52:48,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:52:48,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:52:45" (1/3) ... [2025-03-03 09:52:48,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5fedf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:52:48, skipping insertion in model container [2025-03-03 09:52:48,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:46" (2/3) ... [2025-03-03 09:52:48,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5fedf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:52:48, skipping insertion in model container [2025-03-03 09:52:48,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:52:47" (3/3) ... [2025-03-03 09:52:48,003 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label52.c [2025-03-03 09:52:48,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:52:48,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label52.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:52:48,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:52:48,074 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;@215676d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:52:48,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:52:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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-03 09:52:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 09:52:48,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:48,088 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] [2025-03-03 09:52:48,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1305291665, now seen corresponding path program 1 times [2025-03-03 09:52:48,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361405349] [2025-03-03 09:52:48,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:48,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:48,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 09:52:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 09:52:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361405349] [2025-03-03 09:52:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361405349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:48,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054995474] [2025-03-03 09:52:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:48,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:48,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:48,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:48,813 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-03 09:52:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:49,660 INFO L93 Difference]: Finished difference Result 857 states and 1495 transitions. [2025-03-03 09:52:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:49,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2025-03-03 09:52:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:49,668 INFO L225 Difference]: With dead ends: 857 [2025-03-03 09:52:49,668 INFO L226 Difference]: Without dead ends: 462 [2025-03-03 09:52:49,671 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-03 09:52:49,672 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 142 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:49,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:52:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-03 09:52:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-03-03 09:52:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 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-03 09:52:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2025-03-03 09:52:49,711 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 146 [2025-03-03 09:52:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:49,712 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2025-03-03 09:52:49,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-03 09:52:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2025-03-03 09:52:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 09:52:49,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:49,716 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] [2025-03-03 09:52:49,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:52:49,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:49,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1284636229, now seen corresponding path program 1 times [2025-03-03 09:52:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:49,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697118966] [2025-03-03 09:52:49,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:49,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 09:52:49,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 09:52:49,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:49,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:49,900 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-03 09:52:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697118966] [2025-03-03 09:52:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697118966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391162614] [2025-03-03 09:52:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:49,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:49,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:49,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:49,903 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-03 09:52:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:50,536 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2025-03-03 09:52:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 154 [2025-03-03 09:52:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:50,541 INFO L225 Difference]: With dead ends: 1344 [2025-03-03 09:52:50,541 INFO L226 Difference]: Without dead ends: 886 [2025-03-03 09:52:50,542 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-03 09:52:50,542 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 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-03 09:52:50,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-03 09:52:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2025-03-03 09:52:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 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-03 09:52:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions. [2025-03-03 09:52:50,570 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 154 [2025-03-03 09:52:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:50,571 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions. [2025-03-03 09:52:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-03 09:52:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions. [2025-03-03 09:52:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 09:52:50,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:50,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 09:52:50,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:52:50,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1152153654, now seen corresponding path program 1 times [2025-03-03 09:52:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098827975] [2025-03-03 09:52:50,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:50,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:50,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 09:52:50,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 09:52:50,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:50,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098827975] [2025-03-03 09:52:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098827975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967932832] [2025-03-03 09:52:50,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:50,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:50,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:52:50,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 09:52:51,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 09:52:51,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:51,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:51,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:51,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:52:51,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967932832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:52:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423437768] [2025-03-03 09:52:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:52:51,217 INFO L87 Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-03 09:52:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:51,886 INFO L93 Difference]: Finished difference Result 2554 states and 3872 transitions. [2025-03-03 09:52:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:51,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 161 [2025-03-03 09:52:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:51,892 INFO L225 Difference]: With dead ends: 2554 [2025-03-03 09:52:51,892 INFO L226 Difference]: Without dead ends: 1686 [2025-03-03 09:52:51,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 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-03 09:52:51,894 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 93 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 416 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:51,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 416 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-03-03 09:52:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2025-03-03 09:52:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.3368983957219251) internal successors, (2250), 1683 states have internal predecessors, (2250), 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-03 09:52:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2250 transitions. [2025-03-03 09:52:51,925 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2250 transitions. Word has length 161 [2025-03-03 09:52:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:51,926 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2250 transitions. [2025-03-03 09:52:51,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-03 09:52:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2250 transitions. [2025-03-03 09:52:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 09:52:51,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:51,930 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] [2025-03-03 09:52:51,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:52:52,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:52,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1784113098, now seen corresponding path program 1 times [2025-03-03 09:52:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113132483] [2025-03-03 09:52:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:52,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 09:52:52,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 09:52:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:52,287 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-03 09:52:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113132483] [2025-03-03 09:52:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113132483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:52,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:52,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480395074] [2025-03-03 09:52:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:52,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:52,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:52,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:52,288 INFO L87 Difference]: Start difference. First operand 1684 states and 2250 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-03 09:52:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:52,922 INFO L93 Difference]: Finished difference Result 5005 states and 6690 transitions. [2025-03-03 09:52:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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 169 [2025-03-03 09:52:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:52,932 INFO L225 Difference]: With dead ends: 5005 [2025-03-03 09:52:52,932 INFO L226 Difference]: Without dead ends: 3323 [2025-03-03 09:52:52,934 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-03 09:52:52,935 INFO L435 NwaCegarLoop]: 141 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, 174 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-03 09:52:52,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 174 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-03-03 09:52:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3320. [2025-03-03 09:52:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.2853269056944863) internal successors, (4266), 3319 states have internal predecessors, (4266), 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-03 09:52:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4266 transitions. [2025-03-03 09:52:52,993 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4266 transitions. Word has length 169 [2025-03-03 09:52:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4266 transitions. [2025-03-03 09:52:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-03 09:52:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4266 transitions. [2025-03-03 09:52:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 09:52:52,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:52,998 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] [2025-03-03 09:52:52,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:52:52,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 540756491, now seen corresponding path program 1 times [2025-03-03 09:52:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959455554] [2025-03-03 09:52:52,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 09:52:53,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 09:52:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:53,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:53,105 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-03 09:52:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959455554] [2025-03-03 09:52:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959455554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311976941] [2025-03-03 09:52:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:53,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:53,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:53,107 INFO L87 Difference]: Start difference. First operand 3320 states and 4266 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-03 09:52:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:53,446 INFO L93 Difference]: Finished difference Result 6606 states and 8487 transitions. [2025-03-03 09:52:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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 181 [2025-03-03 09:52:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:53,457 INFO L225 Difference]: With dead ends: 6606 [2025-03-03 09:52:53,457 INFO L226 Difference]: Without dead ends: 3288 [2025-03-03 09:52:53,460 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-03 09:52:53,461 INFO L435 NwaCegarLoop]: 31 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, 31 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-03 09:52:53,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:52:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-03-03 09:52:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2025-03-03 09:52:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.2567690903559476) internal successors, (4131), 3287 states have internal predecessors, (4131), 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-03 09:52:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4131 transitions. [2025-03-03 09:52:53,523 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4131 transitions. Word has length 181 [2025-03-03 09:52:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:53,524 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 4131 transitions. [2025-03-03 09:52:53,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-03 09:52:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4131 transitions. [2025-03-03 09:52:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 09:52:53,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:53,531 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] [2025-03-03 09:52:53,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:52:53,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:53,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1952331578, now seen corresponding path program 1 times [2025-03-03 09:52:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471942703] [2025-03-03 09:52:53,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:53,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 09:52:53,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 09:52:53,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:53,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:53,774 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-03 09:52:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471942703] [2025-03-03 09:52:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471942703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338125001] [2025-03-03 09:52:53,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:53,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:53,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:53,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:53,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:53,776 INFO L87 Difference]: Start difference. First operand 3288 states and 4131 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-03 09:52:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:54,402 INFO L93 Difference]: Finished difference Result 8212 states and 10289 transitions. [2025-03-03 09:52:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-03 09:52:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:54,416 INFO L225 Difference]: With dead ends: 8212 [2025-03-03 09:52:54,416 INFO L226 Difference]: Without dead ends: 4926 [2025-03-03 09:52:54,420 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-03 09:52:54,420 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 197 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:54,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 106 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2025-03-03 09:52:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4925. [2025-03-03 09:52:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4925 states, 4924 states have (on average 1.2408610885458977) internal successors, (6110), 4924 states have internal predecessors, (6110), 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-03 09:52:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6110 transitions. [2025-03-03 09:52:54,498 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6110 transitions. Word has length 187 [2025-03-03 09:52:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 4925 states and 6110 transitions. [2025-03-03 09:52:54,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-03 09:52:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6110 transitions. [2025-03-03 09:52:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 09:52:54,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:54,505 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] [2025-03-03 09:52:54,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:52:54,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1664266837, now seen corresponding path program 1 times [2025-03-03 09:52:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123921446] [2025-03-03 09:52:54,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:54,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 09:52:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 09:52:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:54,846 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-03 09:52:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123921446] [2025-03-03 09:52:54,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123921446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465622253] [2025-03-03 09:52:54,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:54,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:54,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:54,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:52:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 09:52:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 09:52:54,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:54,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:54,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:55,123 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-03 09:52:55,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465622253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:52:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090141963] [2025-03-03 09:52:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:55,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:55,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:55,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:52:55,124 INFO L87 Difference]: Start difference. First operand 4925 states and 6110 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-03 09:52:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:55,734 INFO L93 Difference]: Finished difference Result 9857 states and 12235 transitions. [2025-03-03 09:52:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 194 [2025-03-03 09:52:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:55,748 INFO L225 Difference]: With dead ends: 9857 [2025-03-03 09:52:55,748 INFO L226 Difference]: Without dead ends: 4934 [2025-03-03 09:52:55,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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-03 09:52:55,753 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 79 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:55,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 324 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2025-03-03 09:52:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4925. [2025-03-03 09:52:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4925 states, 4924 states have (on average 1.2274573517465475) internal successors, (6044), 4924 states have internal predecessors, (6044), 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-03 09:52:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6044 transitions. [2025-03-03 09:52:55,825 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6044 transitions. Word has length 194 [2025-03-03 09:52:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:55,826 INFO L471 AbstractCegarLoop]: Abstraction has 4925 states and 6044 transitions. [2025-03-03 09:52:55,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-03 09:52:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6044 transitions. [2025-03-03 09:52:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 09:52:55,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:55,832 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:55,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:52:56,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-03 09:52:56,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:56,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1468676402, now seen corresponding path program 1 times [2025-03-03 09:52:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583444203] [2025-03-03 09:52:56,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:56,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:52:56,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:52:56,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:56,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:52:56,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583444203] [2025-03-03 09:52:56,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583444203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:56,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:56,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:52:56,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775038937] [2025-03-03 09:52:56,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:56,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:56,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:56,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:56,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:56,188 INFO L87 Difference]: Start difference. First operand 4925 states and 6044 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-03 09:52:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:56,838 INFO L93 Difference]: Finished difference Result 12081 states and 15113 transitions. [2025-03-03 09:52:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-03 09:52:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:56,863 INFO L225 Difference]: With dead ends: 12081 [2025-03-03 09:52:56,863 INFO L226 Difference]: Without dead ends: 7158 [2025-03-03 09:52:56,872 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-03 09:52:56,873 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 148 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-03 09:52:56,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 148 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2025-03-03 09:52:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 7158. [2025-03-03 09:52:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 7157 states have (on average 1.1890456895347212) internal successors, (8510), 7157 states have internal predecessors, (8510), 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-03 09:52:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 8510 transitions. [2025-03-03 09:52:57,011 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 8510 transitions. Word has length 200 [2025-03-03 09:52:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:57,012 INFO L471 AbstractCegarLoop]: Abstraction has 7158 states and 8510 transitions. [2025-03-03 09:52:57,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-03 09:52:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 8510 transitions. [2025-03-03 09:52:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 09:52:57,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:57,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:57,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:52:57,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:57,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1548309026, now seen corresponding path program 1 times [2025-03-03 09:52:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159166413] [2025-03-03 09:52:57,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:57,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 09:52:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 09:52:57,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:57,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159166413] [2025-03-03 09:52:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159166413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:57,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60383168] [2025-03-03 09:52:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:57,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:57,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:57,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:57,343 INFO L87 Difference]: Start difference. First operand 7158 states and 8510 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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-03 09:52:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:57,963 INFO L93 Difference]: Finished difference Result 18198 states and 21609 transitions. [2025-03-03 09:52:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 209 [2025-03-03 09:52:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:57,987 INFO L225 Difference]: With dead ends: 18198 [2025-03-03 09:52:57,988 INFO L226 Difference]: Without dead ends: 11042 [2025-03-03 09:52:57,996 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-03 09:52:57,996 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:57,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 94 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11042 states. [2025-03-03 09:52:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11042 to 11036. [2025-03-03 09:52:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11036 states, 11035 states have (on average 1.1763479836882647) internal successors, (12981), 11035 states have internal predecessors, (12981), 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-03 09:52:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11036 states to 11036 states and 12981 transitions. [2025-03-03 09:52:58,150 INFO L78 Accepts]: Start accepts. Automaton has 11036 states and 12981 transitions. Word has length 209 [2025-03-03 09:52:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:58,150 INFO L471 AbstractCegarLoop]: Abstraction has 11036 states and 12981 transitions. [2025-03-03 09:52:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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-03 09:52:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 11036 states and 12981 transitions. [2025-03-03 09:52:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 09:52:58,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:58,161 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, 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] [2025-03-03 09:52:58,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:52:58,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:58,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1553460551, now seen corresponding path program 1 times [2025-03-03 09:52:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306264166] [2025-03-03 09:52:58,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:58,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 09:52:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 09:52:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:58,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:58,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306264166] [2025-03-03 09:52:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306264166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072059591] [2025-03-03 09:52:58,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:58,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:58,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:52:58,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 09:52:58,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 09:52:58,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:58,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:58,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:52:58,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:58,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072059591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:52:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011336438] [2025-03-03 09:52:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:58,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:58,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:52:58,816 INFO L87 Difference]: Start difference. First operand 11036 states and 12981 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03 09:52:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:59,439 INFO L93 Difference]: Finished difference Result 30802 states and 36164 transitions. [2025-03-03 09:52:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:59,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 [2025-03-03 09:52:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:59,473 INFO L225 Difference]: With dead ends: 30802 [2025-03-03 09:52:59,473 INFO L226 Difference]: Without dead ends: 19768 [2025-03-03 09:52:59,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 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-03 09:52:59,487 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 153 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:59,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 149 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2025-03-03 09:52:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 17735. [2025-03-03 09:52:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17735 states, 17734 states have (on average 1.16149768805684) internal successors, (20598), 17734 states have internal predecessors, (20598), 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-03 09:52:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 20598 transitions. [2025-03-03 09:52:59,819 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 20598 transitions. Word has length 216 [2025-03-03 09:52:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:59,819 INFO L471 AbstractCegarLoop]: Abstraction has 17735 states and 20598 transitions. [2025-03-03 09:52:59,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03 09:52:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 20598 transitions. [2025-03-03 09:52:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 09:52:59,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:59,836 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, 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] [2025-03-03 09:52:59,842 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-03 09:53:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:00,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:00,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:00,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1789069786, now seen corresponding path program 1 times [2025-03-03 09:53:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:00,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102692689] [2025-03-03 09:53:00,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:00,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 09:53:00,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 09:53:00,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:00,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102692689] [2025-03-03 09:53:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102692689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340410753] [2025-03-03 09:53:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:00,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:00,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:00,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:00,286 INFO L87 Difference]: Start difference. First operand 17735 states and 20598 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 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-03 09:53:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:00,996 INFO L93 Difference]: Finished difference Result 46073 states and 53522 transitions. [2025-03-03 09:53:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:00,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 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 221 [2025-03-03 09:53:00,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:01,043 INFO L225 Difference]: With dead ends: 46073 [2025-03-03 09:53:01,043 INFO L226 Difference]: Without dead ends: 28340 [2025-03-03 09:53:01,062 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-03 09:53:01,062 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:01,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 153 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28340 states. [2025-03-03 09:53:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28340 to 28337. [2025-03-03 09:53:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28337 states, 28336 states have (on average 1.1597967250141163) internal successors, (32864), 28336 states have internal predecessors, (32864), 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-03 09:53:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28337 states to 28337 states and 32864 transitions. [2025-03-03 09:53:01,418 INFO L78 Accepts]: Start accepts. Automaton has 28337 states and 32864 transitions. Word has length 221 [2025-03-03 09:53:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 28337 states and 32864 transitions. [2025-03-03 09:53:01,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 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-03 09:53:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 28337 states and 32864 transitions. [2025-03-03 09:53:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 09:53:01,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:01,438 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:01,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:53:01,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:01,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1586168267, now seen corresponding path program 1 times [2025-03-03 09:53:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:01,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739504258] [2025-03-03 09:53:01,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:01,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:53:01,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:53:01,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:01,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:02,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739504258] [2025-03-03 09:53:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739504258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:02,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619401274] [2025-03-03 09:53:02,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:02,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:02,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:02,246 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-03 09:53:02,247 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-03 09:53:02,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:53:02,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:53:02,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:02,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:02,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:53:02,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:53:02,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619401274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 09:53:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046394729] [2025-03-03 09:53:02,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:02,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:02,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:02,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:02,440 INFO L87 Difference]: Start difference. First operand 28337 states and 32864 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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-03 09:53:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:03,039 INFO L93 Difference]: Finished difference Result 74583 states and 86667 transitions. [2025-03-03 09:53:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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 228 [2025-03-03 09:53:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:03,123 INFO L225 Difference]: With dead ends: 74583 [2025-03-03 09:53:03,123 INFO L226 Difference]: Without dead ends: 46248 [2025-03-03 09:53:03,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:03,154 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:03,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 123 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:53:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46248 states. [2025-03-03 09:53:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46248 to 40929. [2025-03-03 09:53:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40929 states, 40928 states have (on average 1.172302580140735) internal successors, (47980), 40928 states have internal predecessors, (47980), 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-03 09:53:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40929 states to 40929 states and 47980 transitions. [2025-03-03 09:53:03,732 INFO L78 Accepts]: Start accepts. Automaton has 40929 states and 47980 transitions. Word has length 228 [2025-03-03 09:53:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:03,732 INFO L471 AbstractCegarLoop]: Abstraction has 40929 states and 47980 transitions. [2025-03-03 09:53:03,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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-03 09:53:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 40929 states and 47980 transitions. [2025-03-03 09:53:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 09:53:03,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:03,760 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, 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] [2025-03-03 09:53:03,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:53:03,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:03,961 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash -177437641, now seen corresponding path program 1 times [2025-03-03 09:53:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684015324] [2025-03-03 09:53:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:04,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 09:53:04,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 09:53:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684015324] [2025-03-03 09:53:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684015324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058057148] [2025-03-03 09:53:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:05,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:05,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:05,115 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-03 09:53:05,116 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-03 09:53:05,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 09:53:05,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 09:53:05,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:05,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:05,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:53:05,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:05,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:05,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058057148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:05,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:05,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 09:53:05,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744337932] [2025-03-03 09:53:05,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:05,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:05,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:05,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:05,370 INFO L87 Difference]: Start difference. First operand 40929 states and 47980 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 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-03 09:53:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:05,987 INFO L93 Difference]: Finished difference Result 81862 states and 95968 transitions. [2025-03-03 09:53:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 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 242 [2025-03-03 09:53:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:06,041 INFO L225 Difference]: With dead ends: 81862 [2025-03-03 09:53:06,041 INFO L226 Difference]: Without dead ends: 40935 [2025-03-03 09:53:06,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:06,074 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 119 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 290 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-03 09:53:06,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 290 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:53:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40935 states. [2025-03-03 09:53:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40935 to 39102. [2025-03-03 09:53:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39102 states, 39101 states have (on average 1.1538323828035089) internal successors, (45116), 39101 states have internal predecessors, (45116), 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-03 09:53:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39102 states to 39102 states and 45116 transitions. [2025-03-03 09:53:06,629 INFO L78 Accepts]: Start accepts. Automaton has 39102 states and 45116 transitions. Word has length 242 [2025-03-03 09:53:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 39102 states and 45116 transitions. [2025-03-03 09:53:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 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-03 09:53:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39102 states and 45116 transitions. [2025-03-03 09:53:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 09:53:06,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:06,654 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:06,662 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-03 09:53:06,858 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,SelfDestructingSolverStorable12 [2025-03-03 09:53:06,858 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 294813528, now seen corresponding path program 1 times [2025-03-03 09:53:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402762045] [2025-03-03 09:53:06,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:06,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 09:53:06,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 09:53:06,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:06,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:07,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:07,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402762045] [2025-03-03 09:53:07,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402762045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:07,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:07,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:07,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991417350] [2025-03-03 09:53:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:07,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:07,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:07,095 INFO L87 Difference]: Start difference. First operand 39102 states and 45116 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 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-03 09:53:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:07,718 INFO L93 Difference]: Finished difference Result 87977 states and 101237 transitions. [2025-03-03 09:53:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:07,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 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 276 [2025-03-03 09:53:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:07,773 INFO L225 Difference]: With dead ends: 87977 [2025-03-03 09:53:07,774 INFO L226 Difference]: Without dead ends: 48877 [2025-03-03 09:53:07,802 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-03 09:53:07,803 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:07,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 113 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:53:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48877 states. [2025-03-03 09:53:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48877 to 47222. [2025-03-03 09:53:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47222 states, 47221 states have (on average 1.1301751339446433) internal successors, (53368), 47221 states have internal predecessors, (53368), 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-03 09:53:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47222 states to 47222 states and 53368 transitions. [2025-03-03 09:53:08,354 INFO L78 Accepts]: Start accepts. Automaton has 47222 states and 53368 transitions. Word has length 276 [2025-03-03 09:53:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:08,354 INFO L471 AbstractCegarLoop]: Abstraction has 47222 states and 53368 transitions. [2025-03-03 09:53:08,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 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-03 09:53:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 47222 states and 53368 transitions. [2025-03-03 09:53:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 09:53:08,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:08,381 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:08,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:53:08,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -118652771, now seen corresponding path program 1 times [2025-03-03 09:53:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123589944] [2025-03-03 09:53:08,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 09:53:08,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 09:53:08,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123589944] [2025-03-03 09:53:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123589944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522651165] [2025-03-03 09:53:08,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:08,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:08,668 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-03 09:53:08,669 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-03 09:53:08,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 09:53:08,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 09:53:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:08,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:08,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:09,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522651165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:09,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:09,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006976799] [2025-03-03 09:53:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:09,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:09,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:09,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:09,214 INFO L87 Difference]: Start difference. First operand 47222 states and 53368 transitions. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 3 states have internal predecessors, (283), 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-03 09:53:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:10,273 INFO L93 Difference]: Finished difference Result 130263 states and 147889 transitions. [2025-03-03 09:53:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:53:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 3 states have internal predecessors, (283), 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 283 [2025-03-03 09:53:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:10,374 INFO L225 Difference]: With dead ends: 130263 [2025-03-03 09:53:10,374 INFO L226 Difference]: Without dead ends: 83043 [2025-03-03 09:53:10,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:10,418 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 423 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:10,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 142 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:53:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83043 states. [2025-03-03 09:53:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83043 to 78534. [2025-03-03 09:53:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78534 states, 78533 states have (on average 1.1110870589433741) internal successors, (87257), 78533 states have internal predecessors, (87257), 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-03 09:53:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78534 states to 78534 states and 87257 transitions. [2025-03-03 09:53:11,498 INFO L78 Accepts]: Start accepts. Automaton has 78534 states and 87257 transitions. Word has length 283 [2025-03-03 09:53:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:11,498 INFO L471 AbstractCegarLoop]: Abstraction has 78534 states and 87257 transitions. [2025-03-03 09:53:11,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 3 states have internal predecessors, (283), 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-03 09:53:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 78534 states and 87257 transitions. [2025-03-03 09:53:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 09:53:11,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:11,531 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:53:11,537 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-03 09:53:11,737 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,SelfDestructingSolverStorable14 [2025-03-03 09:53:11,737 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:11,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash -781942469, now seen corresponding path program 1 times [2025-03-03 09:53:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723696578] [2025-03-03 09:53:11,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:11,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 09:53:11,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 09:53:11,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723696578] [2025-03-03 09:53:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723696578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272443661] [2025-03-03 09:53:11,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:11,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:11,930 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-03 09:53:11,931 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-03 09:53:12,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 09:53:12,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 09:53:12,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:12,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:12,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:53:12,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:12,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272443661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109392905] [2025-03-03 09:53:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:12,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:12,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:12,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:12,236 INFO L87 Difference]: Start difference. First operand 78534 states and 87257 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-03 09:53:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:12,866 INFO L93 Difference]: Finished difference Result 220268 states and 244749 transitions. [2025-03-03 09:53:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 283 [2025-03-03 09:53:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:13,050 INFO L225 Difference]: With dead ends: 220268 [2025-03-03 09:53:13,051 INFO L226 Difference]: Without dead ends: 141736 [2025-03-03 09:53:13,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 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-03 09:53:13,122 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 233 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:13,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 821 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:53:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141736 states. [2025-03-03 09:53:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141736 to 132599. [2025-03-03 09:53:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132599 states, 132598 states have (on average 1.10466221209973) internal successors, (146476), 132598 states have internal predecessors, (146476), 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-03 09:53:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132599 states to 132599 states and 146476 transitions. [2025-03-03 09:53:15,070 INFO L78 Accepts]: Start accepts. Automaton has 132599 states and 146476 transitions. Word has length 283 [2025-03-03 09:53:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 132599 states and 146476 transitions. [2025-03-03 09:53:15,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-03 09:53:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 132599 states and 146476 transitions. [2025-03-03 09:53:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 09:53:15,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:15,113 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:15,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:53:15,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:15,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash 75240403, now seen corresponding path program 1 times [2025-03-03 09:53:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805053378] [2025-03-03 09:53:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:15,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 09:53:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 09:53:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805053378] [2025-03-03 09:53:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805053378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:15,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509135146] [2025-03-03 09:53:15,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:15,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:15,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:15,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:15,425 INFO L87 Difference]: Start difference. First operand 132599 states and 146476 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-03 09:53:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:16,356 INFO L93 Difference]: Finished difference Result 232464 states and 256791 transitions. [2025-03-03 09:53:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:16,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 284 [2025-03-03 09:53:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:16,493 INFO L225 Difference]: With dead ends: 232464 [2025-03-03 09:53:16,494 INFO L226 Difference]: Without dead ends: 99867 [2025-03-03 09:53:16,707 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-03 09:53:16,707 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 208 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:16,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:53:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99867 states. [2025-03-03 09:53:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99867 to 98025. [2025-03-03 09:53:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98025 states, 98024 states have (on average 1.095292989471966) internal successors, (107365), 98024 states have internal predecessors, (107365), 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-03 09:53:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98025 states to 98025 states and 107365 transitions. [2025-03-03 09:53:17,830 INFO L78 Accepts]: Start accepts. Automaton has 98025 states and 107365 transitions. Word has length 284 [2025-03-03 09:53:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:17,831 INFO L471 AbstractCegarLoop]: Abstraction has 98025 states and 107365 transitions. [2025-03-03 09:53:17,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-03 09:53:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 98025 states and 107365 transitions. [2025-03-03 09:53:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 09:53:18,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:18,025 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:18,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:53:18,025 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:18,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash -579921933, now seen corresponding path program 1 times [2025-03-03 09:53:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395124803] [2025-03-03 09:53:18,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:18,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 09:53:18,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 09:53:18,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:18,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:53:18,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395124803] [2025-03-03 09:53:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395124803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:18,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080853552] [2025-03-03 09:53:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:18,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:18,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:18,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:18,226 INFO L87 Difference]: Start difference. First operand 98025 states and 107365 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-03 09:53:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:19,149 INFO L93 Difference]: Finished difference Result 199525 states and 218716 transitions. [2025-03-03 09:53:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 291 [2025-03-03 09:53:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:19,278 INFO L225 Difference]: With dead ends: 199525 [2025-03-03 09:53:19,279 INFO L226 Difference]: Without dead ends: 99472 [2025-03-03 09:53:19,339 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-03 09:53:19,340 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:19,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 371 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:53:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99472 states. [2025-03-03 09:53:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99472 to 97633. [2025-03-03 09:53:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97633 states, 97632 states have (on average 1.0886594559160931) internal successors, (106288), 97632 states have internal predecessors, (106288), 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-03 09:53:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97633 states to 97633 states and 106288 transitions. [2025-03-03 09:53:20,610 INFO L78 Accepts]: Start accepts. Automaton has 97633 states and 106288 transitions. Word has length 291 [2025-03-03 09:53:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:20,611 INFO L471 AbstractCegarLoop]: Abstraction has 97633 states and 106288 transitions. [2025-03-03 09:53:20,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-03 09:53:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 97633 states and 106288 transitions. [2025-03-03 09:53:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 09:53:20,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:20,645 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 09:53:20,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1567000815, now seen corresponding path program 1 times [2025-03-03 09:53:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420232770] [2025-03-03 09:53:20,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:20,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 09:53:20,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 09:53:20,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:20,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 09:53:21,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:21,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420232770] [2025-03-03 09:53:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420232770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:21,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409011690] [2025-03-03 09:53:21,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:21,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:21,243 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:53:21,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:53:21,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 09:53:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 09:53:21,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:21,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:21,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:21,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:53:21,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409011690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916014820] [2025-03-03 09:53:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:21,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:21,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:21,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:21,460 INFO L87 Difference]: Start difference. First operand 97633 states and 106288 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03 09:53:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:22,389 INFO L93 Difference]: Finished difference Result 176133 states and 191855 transitions. [2025-03-03 09:53:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 296 [2025-03-03 09:53:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:22,513 INFO L225 Difference]: With dead ends: 176133 [2025-03-03 09:53:22,513 INFO L226 Difference]: Without dead ends: 78502 [2025-03-03 09:53:22,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 295 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-03 09:53:22,577 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 215 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:22,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 332 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:53:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78502 states. [2025-03-03 09:53:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78502 to 76466. [2025-03-03 09:53:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76466 states, 76465 states have (on average 1.0710521153468908) internal successors, (81898), 76465 states have internal predecessors, (81898), 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-03 09:53:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76466 states to 76466 states and 81898 transitions. [2025-03-03 09:53:23,454 INFO L78 Accepts]: Start accepts. Automaton has 76466 states and 81898 transitions. Word has length 296 [2025-03-03 09:53:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 76466 states and 81898 transitions. [2025-03-03 09:53:23,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03 09:53:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 76466 states and 81898 transitions. [2025-03-03 09:53:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 09:53:23,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:23,480 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:23,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:53:23,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:23,680 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:23,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1116086184, now seen corresponding path program 1 times [2025-03-03 09:53:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:23,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686477041] [2025-03-03 09:53:23,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:23,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 09:53:23,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 09:53:23,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-03 09:53:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686477041] [2025-03-03 09:53:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686477041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388723909] [2025-03-03 09:53:24,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:24,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:24,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:24,049 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:53:24,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:53:24,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 09:53:24,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 09:53:24,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:24,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:24,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:24,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 09:53:24,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388723909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:24,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723602525] [2025-03-03 09:53:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:24,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:24,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:24,200 INFO L87 Difference]: Start difference. First operand 76466 states and 81898 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-03 09:53:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:24,815 INFO L93 Difference]: Finished difference Result 209444 states and 224206 transitions. [2025-03-03 09:53:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:24,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 302 [2025-03-03 09:53:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:24,948 INFO L225 Difference]: With dead ends: 209444 [2025-03-03 09:53:24,948 INFO L226 Difference]: Without dead ends: 132980 [2025-03-03 09:53:24,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 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-03 09:53:24,990 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 298 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 850 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-03 09:53:24,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 850 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:53:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132980 states. [2025-03-03 09:53:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132980 to 131350. [2025-03-03 09:53:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131350 states, 131349 states have (on average 1.0653830634416708) internal successors, (139937), 131349 states have internal predecessors, (139937), 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-03 09:53:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131350 states to 131350 states and 139937 transitions. [2025-03-03 09:53:26,782 INFO L78 Accepts]: Start accepts. Automaton has 131350 states and 139937 transitions. Word has length 302 [2025-03-03 09:53:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:26,783 INFO L471 AbstractCegarLoop]: Abstraction has 131350 states and 139937 transitions. [2025-03-03 09:53:26,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-03 09:53:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 131350 states and 139937 transitions. [2025-03-03 09:53:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 09:53:26,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:26,818 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:26,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:53:27,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:27,019 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:27,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1968667079, now seen corresponding path program 1 times [2025-03-03 09:53:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689625200] [2025-03-03 09:53:27,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:27,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 09:53:27,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 09:53:27,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:27,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 09:53:27,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:27,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689625200] [2025-03-03 09:53:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689625200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:27,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:27,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:53:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595172510] [2025-03-03 09:53:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:27,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:27,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:27,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:53:27,171 INFO L87 Difference]: Start difference. First operand 131350 states and 139937 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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-03 09:53:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:28,375 INFO L93 Difference]: Finished difference Result 320241 states and 341193 transitions. [2025-03-03 09:53:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:28,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 304 [2025-03-03 09:53:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:28,616 INFO L225 Difference]: With dead ends: 320241 [2025-03-03 09:53:28,617 INFO L226 Difference]: Without dead ends: 188893 [2025-03-03 09:53:28,709 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-03 09:53:28,710 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 206 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:28,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 136 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:53:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188893 states. [2025-03-03 09:53:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188893 to 186651. [2025-03-03 09:53:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186651 states, 186650 states have (on average 1.0645432627913207) internal successors, (198697), 186650 states have internal predecessors, (198697), 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-03 09:53:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186651 states to 186651 states and 198697 transitions. [2025-03-03 09:53:31,346 INFO L78 Accepts]: Start accepts. Automaton has 186651 states and 198697 transitions. Word has length 304 [2025-03-03 09:53:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:31,346 INFO L471 AbstractCegarLoop]: Abstraction has 186651 states and 198697 transitions. [2025-03-03 09:53:31,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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-03 09:53:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 186651 states and 198697 transitions. [2025-03-03 09:53:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 09:53:31,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:31,399 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:31,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 09:53:31,399 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1645175298, now seen corresponding path program 1 times [2025-03-03 09:53:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102707324] [2025-03-03 09:53:31,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 09:53:31,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 09:53:31,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:31,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 09:53:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102707324] [2025-03-03 09:53:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102707324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709060056] [2025-03-03 09:53:31,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:31,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:31,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:53:31,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:53:31,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 09:53:31,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 09:53:31,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:31,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:31,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:53:31,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709060056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650925767] [2025-03-03 09:53:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:31,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:31,866 INFO L87 Difference]: Start difference. First operand 186651 states and 198697 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-03 09:53:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:33,099 INFO L93 Difference]: Finished difference Result 344225 states and 366039 transitions. [2025-03-03 09:53:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 311 [2025-03-03 09:53:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:33,307 INFO L225 Difference]: With dead ends: 344225 [2025-03-03 09:53:33,307 INFO L226 Difference]: Without dead ends: 156764 [2025-03-03 09:53:33,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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-03 09:53:33,410 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 121 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:33,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 308 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:53:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156764 states. [2025-03-03 09:53:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156764 to 129547. [2025-03-03 09:53:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129547 states, 129546 states have (on average 1.0526762694332514) internal successors, (136370), 129546 states have internal predecessors, (136370), 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-03 09:53:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129547 states to 129547 states and 136370 transitions. [2025-03-03 09:53:35,455 INFO L78 Accepts]: Start accepts. Automaton has 129547 states and 136370 transitions. Word has length 311 [2025-03-03 09:53:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:35,456 INFO L471 AbstractCegarLoop]: Abstraction has 129547 states and 136370 transitions. [2025-03-03 09:53:35,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-03 09:53:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 129547 states and 136370 transitions. [2025-03-03 09:53:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-03 09:53:35,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:35,505 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:35,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:53:35,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 09:53:35,706 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 628751358, now seen corresponding path program 1 times [2025-03-03 09:53:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454407687] [2025-03-03 09:53:35,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:35,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-03 09:53:35,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-03 09:53:35,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:35,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-03 09:53:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454407687] [2025-03-03 09:53:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454407687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947128122] [2025-03-03 09:53:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:36,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:36,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:36,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:53:36,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:53:36,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-03 09:53:36,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-03 09:53:36,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:36,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:36,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:53:36,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 09:53:36,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947128122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:36,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107609088] [2025-03-03 09:53:36,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:36,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:53:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:36,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:53:36,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:53:36,570 INFO L87 Difference]: Start difference. First operand 129547 states and 136370 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-03 09:53:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:37,729 INFO L93 Difference]: Finished difference Result 253043 states and 266102 transitions. [2025-03-03 09:53:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:53:37,730 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 317 [2025-03-03 09:53:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:37,895 INFO L225 Difference]: With dead ends: 253043 [2025-03-03 09:53:37,896 INFO L226 Difference]: Without dead ends: 123498 [2025-03-03 09:53:37,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 316 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-03 09:53:37,959 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 88 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:37,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 343 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:53:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123498 states. [2025-03-03 09:53:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123498 to 122230. [2025-03-03 09:53:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122230 states, 122229 states have (on average 1.0475500904040775) internal successors, (128041), 122229 states have internal predecessors, (128041), 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-03 09:53:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122230 states to 122230 states and 128041 transitions. [2025-03-03 09:53:39,286 INFO L78 Accepts]: Start accepts. Automaton has 122230 states and 128041 transitions. Word has length 317 [2025-03-03 09:53:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:39,287 INFO L471 AbstractCegarLoop]: Abstraction has 122230 states and 128041 transitions. [2025-03-03 09:53:39,287 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-03 09:53:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 122230 states and 128041 transitions. [2025-03-03 09:53:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 09:53:39,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:39,326 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:53:39,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:53:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 09:53:39,526 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1936737824, now seen corresponding path program 1 times [2025-03-03 09:53:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612832868] [2025-03-03 09:53:39,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:39,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 09:53:39,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 09:53:39,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:39,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 09:53:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612832868] [2025-03-03 09:53:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612832868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:53:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145136479] [2025-03-03 09:53:40,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:40,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:53:40,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:53:40,115 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:53:40,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:53:40,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 09:53:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 09:53:40,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:40,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:53:40,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:53:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 09:53:40,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:53:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145136479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:40,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:53:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:53:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676281348] [2025-03-03 09:53:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:40,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:40,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:40,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:40,365 INFO L87 Difference]: Start difference. First operand 122230 states and 128041 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-03 09:53:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:41,776 INFO L93 Difference]: Finished difference Result 314581 states and 329697 transitions. [2025-03-03 09:53:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:53:41,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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 351 [2025-03-03 09:53:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:41,986 INFO L225 Difference]: With dead ends: 314581 [2025-03-03 09:53:41,986 INFO L226 Difference]: Without dead ends: 192353 [2025-03-03 09:53:42,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:53:42,050 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 739 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:42,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 311 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:53:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192353 states.