./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:38:47,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:38:47,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:38:47,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:38:47,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:38:47,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:38:47,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:38:47,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:38:47,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:38:47,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:38:47,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:38:47,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:38:47,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:38:47,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:38:47,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:38:47,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:38:47,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:38:47,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:38:47,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:38:47,664 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 [2025-03-16 21:38:47,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:38:47,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:38:47,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:38:47,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:38:47,903 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:38:47,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-03-16 21:38:49,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743f56678/ec931ccabb5a49b1a0669300003d4d86/FLAGfe4a60c81 [2025-03-16 21:38:49,313 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:38:49,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-03-16 21:38:49,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743f56678/ec931ccabb5a49b1a0669300003d4d86/FLAGfe4a60c81 [2025-03-16 21:38:49,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743f56678/ec931ccabb5a49b1a0669300003d4d86 [2025-03-16 21:38:49,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:38:49,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:38:49,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:38:49,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:38:49,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:38:49,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:38:49" (1/1) ... [2025-03-16 21:38:49,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a9f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:49, skipping insertion in model container [2025-03-16 21:38:49,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:38:49" (1/1) ... [2025-03-16 21:38:49,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:38:49,780 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/hardware-verification-bv/btor2c-lazyMod.client_server.c[1253,1266] [2025-03-16 21:38:49,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:38:49,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:38:49,937 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/hardware-verification-bv/btor2c-lazyMod.client_server.c[1253,1266] [2025-03-16 21:38:50,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:38:50,028 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:38:50,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50 WrapperNode [2025-03-16 21:38:50,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:38:50,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:38:50,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:38:50,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:38:50,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,108 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 860 [2025-03-16 21:38:50,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:38:50,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:38:50,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:38:50,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:38:50,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,173 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:38:50,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:38:50,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:38:50,243 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:38:50,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:38:50,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (1/1) ... [2025-03-16 21:38:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:38:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:38:50,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:38:50,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:38:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:38:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:38:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:38:50,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:38:50,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:38:50,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:38:51,266 INFO L? ?]: Removed 561 outVars from TransFormulas that were not future-live. [2025-03-16 21:38:51,266 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:38:51,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:38:51,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:38:51,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:38:51 BoogieIcfgContainer [2025-03-16 21:38:51,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:38:51,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:38:51,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:38:51,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:38:51,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:38:49" (1/3) ... [2025-03-16 21:38:51,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483d7d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:38:51, skipping insertion in model container [2025-03-16 21:38:51,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:38:50" (2/3) ... [2025-03-16 21:38:51,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483d7d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:38:51, skipping insertion in model container [2025-03-16 21:38:51,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:38:51" (3/3) ... [2025-03-16 21:38:51,320 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.client_server.c [2025-03-16 21:38:51,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:38:51,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.client_server.c that has 1 procedures, 208 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:38:51,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:38:51,392 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;@5c7211b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:38:51,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:38:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 206 states have (on average 1.5) internal successors, (309), 207 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 21:38:51,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:51,402 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] [2025-03-16 21:38:51,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:51,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1678991188, now seen corresponding path program 1 times [2025-03-16 21:38:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866168064] [2025-03-16 21:38:51,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:51,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 21:38:51,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 21:38:51,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:51,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:52,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866168064] [2025-03-16 21:38:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866168064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005353469] [2025-03-16 21:38:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:52,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:52,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:52,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:52,353 INFO L87 Difference]: Start difference. First operand has 208 states, 206 states have (on average 1.5) internal successors, (309), 207 states have internal predecessors, (309), 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 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:52,538 INFO L93 Difference]: Finished difference Result 395 states and 589 transitions. [2025-03-16 21:38:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-03-16 21:38:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:52,549 INFO L225 Difference]: With dead ends: 395 [2025-03-16 21:38:52,549 INFO L226 Difference]: Without dead ends: 208 [2025-03-16 21:38:52,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:52,555 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:52,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:38:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-16 21:38:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-16 21:38:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.4879227053140096) internal successors, (308), 207 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 308 transitions. [2025-03-16 21:38:52,593 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 308 transitions. Word has length 40 [2025-03-16 21:38:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:52,593 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 308 transitions. [2025-03-16 21:38:52,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 308 transitions. [2025-03-16 21:38:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 21:38:52,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:52,596 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] [2025-03-16 21:38:52,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:38:52,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:52,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash 513798643, now seen corresponding path program 1 times [2025-03-16 21:38:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806226443] [2025-03-16 21:38:52,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 21:38:52,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 21:38:52,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:52,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806226443] [2025-03-16 21:38:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806226443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:52,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718944820] [2025-03-16 21:38:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:52,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:38:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:52,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:38:52,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:52,962 INFO L87 Difference]: Start difference. First operand 208 states and 308 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:53,076 INFO L93 Difference]: Finished difference Result 397 states and 588 transitions. [2025-03-16 21:38:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:38:53,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-03-16 21:38:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:53,078 INFO L225 Difference]: With dead ends: 397 [2025-03-16 21:38:53,078 INFO L226 Difference]: Without dead ends: 210 [2025-03-16 21:38:53,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:38:53,079 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:53,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 754 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:38:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-16 21:38:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-16 21:38:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.4832535885167464) internal successors, (310), 209 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 310 transitions. [2025-03-16 21:38:53,091 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 310 transitions. Word has length 41 [2025-03-16 21:38:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:53,092 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 310 transitions. [2025-03-16 21:38:53,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 310 transitions. [2025-03-16 21:38:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 21:38:53,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:53,093 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] [2025-03-16 21:38:53,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:38:53,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:53,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 679398191, now seen corresponding path program 1 times [2025-03-16 21:38:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489658394] [2025-03-16 21:38:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:53,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 21:38:53,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 21:38:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:53,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489658394] [2025-03-16 21:38:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489658394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:53,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:38:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798671812] [2025-03-16 21:38:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:53,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:38:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:53,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:38:53,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:53,623 INFO L87 Difference]: Start difference. First operand 210 states and 310 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:53,783 INFO L93 Difference]: Finished difference Result 407 states and 601 transitions. [2025-03-16 21:38:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:38:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 42 [2025-03-16 21:38:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:53,785 INFO L225 Difference]: With dead ends: 407 [2025-03-16 21:38:53,786 INFO L226 Difference]: Without dead ends: 218 [2025-03-16 21:38:53,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:53,787 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 5 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:53,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1001 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:38:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-16 21:38:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-03-16 21:38:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4766355140186915) internal successors, (316), 214 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 316 transitions. [2025-03-16 21:38:53,793 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 316 transitions. Word has length 42 [2025-03-16 21:38:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:53,793 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 316 transitions. [2025-03-16 21:38:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 316 transitions. [2025-03-16 21:38:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 21:38:53,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:53,794 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] [2025-03-16 21:38:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:38:53,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash 684126282, now seen corresponding path program 1 times [2025-03-16 21:38:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30849038] [2025-03-16 21:38:53,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:53,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 21:38:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 21:38:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30849038] [2025-03-16 21:38:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30849038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382878098] [2025-03-16 21:38:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:54,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:54,174 INFO L87 Difference]: Start difference. First operand 215 states and 316 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:54,342 INFO L93 Difference]: Finished difference Result 413 states and 607 transitions. [2025-03-16 21:38:54,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2025-03-16 21:38:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:54,344 INFO L225 Difference]: With dead ends: 413 [2025-03-16 21:38:54,344 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 21:38:54,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-16 21:38:54,345 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 278 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:54,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 708 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:38:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 21:38:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2025-03-16 21:38:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.4746543778801844) internal successors, (320), 217 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2025-03-16 21:38:54,350 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 43 [2025-03-16 21:38:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:54,350 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2025-03-16 21:38:54,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2025-03-16 21:38:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 21:38:54,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:54,351 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] [2025-03-16 21:38:54,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:38:54,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:54,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:54,352 INFO L85 PathProgramCache]: Analyzing trace with hash -666861093, now seen corresponding path program 1 times [2025-03-16 21:38:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816155760] [2025-03-16 21:38:54,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:54,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 21:38:54,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 21:38:54,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:54,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816155760] [2025-03-16 21:38:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816155760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:55,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517215605] [2025-03-16 21:38:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:55,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:55,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:55,093 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:55,287 INFO L93 Difference]: Finished difference Result 532 states and 778 transitions. [2025-03-16 21:38:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-03-16 21:38:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:55,288 INFO L225 Difference]: With dead ends: 532 [2025-03-16 21:38:55,288 INFO L226 Difference]: Without dead ends: 335 [2025-03-16 21:38:55,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:55,289 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 452 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:55,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 708 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-16 21:38:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 220. [2025-03-16 21:38:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.4703196347031964) internal successors, (322), 219 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2025-03-16 21:38:55,295 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 44 [2025-03-16 21:38:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:55,296 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2025-03-16 21:38:55,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2025-03-16 21:38:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 21:38:55,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:55,297 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] [2025-03-16 21:38:55,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:38:55,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:55,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 547475749, now seen corresponding path program 1 times [2025-03-16 21:38:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545174866] [2025-03-16 21:38:55,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:55,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 21:38:55,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 21:38:55,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:55,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545174866] [2025-03-16 21:38:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545174866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:55,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102874428] [2025-03-16 21:38:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:55,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:55,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:55,736 INFO L87 Difference]: Start difference. First operand 220 states and 322 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:55,919 INFO L93 Difference]: Finished difference Result 426 states and 624 transitions. [2025-03-16 21:38:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:38:55,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44 [2025-03-16 21:38:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:55,922 INFO L225 Difference]: With dead ends: 426 [2025-03-16 21:38:55,922 INFO L226 Difference]: Without dead ends: 229 [2025-03-16 21:38:55,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:55,923 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:55,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1235 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-16 21:38:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2025-03-16 21:38:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.4663677130044843) internal successors, (327), 223 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 327 transitions. [2025-03-16 21:38:55,933 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 327 transitions. Word has length 44 [2025-03-16 21:38:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:55,934 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 327 transitions. [2025-03-16 21:38:55,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 327 transitions. [2025-03-16 21:38:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 21:38:55,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:55,935 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] [2025-03-16 21:38:55,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:38:55,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:55,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 773909216, now seen corresponding path program 1 times [2025-03-16 21:38:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417699403] [2025-03-16 21:38:55,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:55,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 21:38:56,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 21:38:56,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:56,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417699403] [2025-03-16 21:38:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417699403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:56,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:56,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:56,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081001385] [2025-03-16 21:38:56,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:56,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:38:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:56,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:38:56,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:38:56,699 INFO L87 Difference]: Start difference. First operand 224 states and 327 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:57,021 INFO L93 Difference]: Finished difference Result 536 states and 780 transitions. [2025-03-16 21:38:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:38:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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 44 [2025-03-16 21:38:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:57,023 INFO L225 Difference]: With dead ends: 536 [2025-03-16 21:38:57,023 INFO L226 Difference]: Without dead ends: 335 [2025-03-16 21:38:57,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:38:57,024 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 444 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:57,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1396 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:38:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-16 21:38:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 226. [2025-03-16 21:38:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2025-03-16 21:38:57,029 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 44 [2025-03-16 21:38:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:57,030 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2025-03-16 21:38:57,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2025-03-16 21:38:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 21:38:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:57,031 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] [2025-03-16 21:38:57,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:38:57,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:57,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1955710528, now seen corresponding path program 1 times [2025-03-16 21:38:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525339201] [2025-03-16 21:38:57,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:57,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 21:38:57,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 21:38:57,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:57,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525339201] [2025-03-16 21:38:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525339201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927525902] [2025-03-16 21:38:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:57,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:57,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:57,424 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:57,598 INFO L93 Difference]: Finished difference Result 436 states and 636 transitions. [2025-03-16 21:38:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:38:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 45 [2025-03-16 21:38:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:57,600 INFO L225 Difference]: With dead ends: 436 [2025-03-16 21:38:57,600 INFO L226 Difference]: Without dead ends: 235 [2025-03-16 21:38:57,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:57,602 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:57,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1235 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-16 21:38:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2025-03-16 21:38:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4585152838427948) internal successors, (334), 229 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 334 transitions. [2025-03-16 21:38:57,609 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 334 transitions. Word has length 45 [2025-03-16 21:38:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:57,610 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 334 transitions. [2025-03-16 21:38:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 334 transitions. [2025-03-16 21:38:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 21:38:57,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:57,610 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] [2025-03-16 21:38:57,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:38:57,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:57,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1323133179, now seen corresponding path program 1 times [2025-03-16 21:38:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173813993] [2025-03-16 21:38:57,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:57,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 21:38:57,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 21:38:57,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:57,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173813993] [2025-03-16 21:38:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173813993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:58,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909410867] [2025-03-16 21:38:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:58,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:58,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:58,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:58,011 INFO L87 Difference]: Start difference. First operand 230 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:58,230 INFO L93 Difference]: Finished difference Result 616 states and 896 transitions. [2025-03-16 21:38:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2025-03-16 21:38:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:58,233 INFO L225 Difference]: With dead ends: 616 [2025-03-16 21:38:58,233 INFO L226 Difference]: Without dead ends: 411 [2025-03-16 21:38:58,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:58,234 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 794 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:58,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 696 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-16 21:38:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 235. [2025-03-16 21:38:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4487179487179487) internal successors, (339), 234 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 339 transitions. [2025-03-16 21:38:58,240 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 339 transitions. Word has length 45 [2025-03-16 21:38:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 339 transitions. [2025-03-16 21:38:58,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 339 transitions. [2025-03-16 21:38:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 21:38:58,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:58,241 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] [2025-03-16 21:38:58,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:38:58,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:58,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1408164401, now seen corresponding path program 1 times [2025-03-16 21:38:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110850961] [2025-03-16 21:38:58,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:58,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 21:38:58,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 21:38:58,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:58,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110850961] [2025-03-16 21:38:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110850961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:38:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610445391] [2025-03-16 21:38:58,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:58,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:38:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:58,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:38:58,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:58,563 INFO L87 Difference]: Start difference. First operand 235 states and 339 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:58,729 INFO L93 Difference]: Finished difference Result 449 states and 651 transitions. [2025-03-16 21:38:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:38:58,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 46 [2025-03-16 21:38:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:58,731 INFO L225 Difference]: With dead ends: 449 [2025-03-16 21:38:58,731 INFO L226 Difference]: Without dead ends: 244 [2025-03-16 21:38:58,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:38:58,732 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:58,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1235 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-16 21:38:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 239. [2025-03-16 21:38:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.4453781512605042) internal successors, (344), 238 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 344 transitions. [2025-03-16 21:38:58,740 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 344 transitions. Word has length 46 [2025-03-16 21:38:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:58,740 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 344 transitions. [2025-03-16 21:38:58,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 344 transitions. [2025-03-16 21:38:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 21:38:58,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:58,741 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] [2025-03-16 21:38:58,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:38:58,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:58,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2144805514, now seen corresponding path program 1 times [2025-03-16 21:38:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:58,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358774075] [2025-03-16 21:38:58,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 21:38:58,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 21:38:58,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:58,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358774075] [2025-03-16 21:38:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358774075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:59,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:38:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486472258] [2025-03-16 21:38:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:59,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:38:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:59,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:38:59,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:38:59,134 INFO L87 Difference]: Start difference. First operand 239 states and 344 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:38:59,333 INFO L93 Difference]: Finished difference Result 602 states and 871 transitions. [2025-03-16 21:38:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:38:59,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-03-16 21:38:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:38:59,335 INFO L225 Difference]: With dead ends: 602 [2025-03-16 21:38:59,335 INFO L226 Difference]: Without dead ends: 393 [2025-03-16 21:38:59,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:38:59,336 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 696 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:38:59,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 693 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:38:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-16 21:38:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 247. [2025-03-16 21:38:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.434959349593496) internal successors, (353), 246 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 353 transitions. [2025-03-16 21:38:59,342 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 353 transitions. Word has length 46 [2025-03-16 21:38:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:38:59,342 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 353 transitions. [2025-03-16 21:38:59,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:38:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 353 transitions. [2025-03-16 21:38:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 21:38:59,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:38:59,343 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] [2025-03-16 21:38:59,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:38:59,343 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:38:59,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:38:59,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1545629678, now seen corresponding path program 1 times [2025-03-16 21:38:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:38:59,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000481521] [2025-03-16 21:38:59,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:38:59,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:38:59,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 21:38:59,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 21:38:59,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:38:59,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:38:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:38:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:38:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000481521] [2025-03-16 21:38:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000481521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:38:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:38:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:38:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459851070] [2025-03-16 21:38:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:38:59,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:38:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:38:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:38:59,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:38:59,760 INFO L87 Difference]: Start difference. First operand 247 states and 353 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:00,063 INFO L93 Difference]: Finished difference Result 470 states and 677 transitions. [2025-03-16 21:39:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:39:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 46 [2025-03-16 21:39:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:00,064 INFO L225 Difference]: With dead ends: 470 [2025-03-16 21:39:00,064 INFO L226 Difference]: Without dead ends: 258 [2025-03-16 21:39:00,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:39:00,065 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 9 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:00,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1983 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:39:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-16 21:39:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2025-03-16 21:39:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.434782608695652) internal successors, (363), 253 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 363 transitions. [2025-03-16 21:39:00,071 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 363 transitions. Word has length 46 [2025-03-16 21:39:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:00,071 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 363 transitions. [2025-03-16 21:39:00,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 363 transitions. [2025-03-16 21:39:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 21:39:00,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:00,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:00,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:39:00,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:00,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 176237034, now seen corresponding path program 1 times [2025-03-16 21:39:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:00,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933109897] [2025-03-16 21:39:00,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:00,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 21:39:00,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 21:39:00,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:00,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933109897] [2025-03-16 21:39:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933109897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:39:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746063697] [2025-03-16 21:39:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:39:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:00,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:39:00,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:39:00,387 INFO L87 Difference]: Start difference. First operand 254 states and 363 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:00,544 INFO L93 Difference]: Finished difference Result 482 states and 694 transitions. [2025-03-16 21:39:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:39:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 47 [2025-03-16 21:39:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:00,546 INFO L225 Difference]: With dead ends: 482 [2025-03-16 21:39:00,546 INFO L226 Difference]: Without dead ends: 263 [2025-03-16 21:39:00,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:39:00,547 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:00,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1235 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:39:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-16 21:39:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2025-03-16 21:39:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 368 transitions. [2025-03-16 21:39:00,554 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 368 transitions. Word has length 47 [2025-03-16 21:39:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:00,555 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 368 transitions. [2025-03-16 21:39:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 368 transitions. [2025-03-16 21:39:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 21:39:00,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:00,555 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] [2025-03-16 21:39:00,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:39:00,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:00,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1830428180, now seen corresponding path program 1 times [2025-03-16 21:39:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71979019] [2025-03-16 21:39:00,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:00,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 21:39:00,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 21:39:00,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:00,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:01,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71979019] [2025-03-16 21:39:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71979019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:01,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-16 21:39:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441960127] [2025-03-16 21:39:01,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:01,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 21:39:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:01,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 21:39:01,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2025-03-16 21:39:01,154 INFO L87 Difference]: Start difference. First operand 258 states and 368 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:01,936 INFO L93 Difference]: Finished difference Result 520 states and 746 transitions. [2025-03-16 21:39:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 21:39:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 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 47 [2025-03-16 21:39:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:01,938 INFO L225 Difference]: With dead ends: 520 [2025-03-16 21:39:01,938 INFO L226 Difference]: Without dead ends: 297 [2025-03-16 21:39:01,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2025-03-16 21:39:01,939 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 25 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:01,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4463 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:39:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-16 21:39:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2025-03-16 21:39:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4329896907216495) internal successors, (417), 291 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 417 transitions. [2025-03-16 21:39:01,947 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 417 transitions. Word has length 47 [2025-03-16 21:39:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:01,948 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 417 transitions. [2025-03-16 21:39:01,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 417 transitions. [2025-03-16 21:39:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 21:39:01,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:01,948 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] [2025-03-16 21:39:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:39:01,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:01,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash 174375973, now seen corresponding path program 1 times [2025-03-16 21:39:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:01,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822342979] [2025-03-16 21:39:01,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:01,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 21:39:02,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 21:39:02,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:02,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822342979] [2025-03-16 21:39:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822342979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:39:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197807685] [2025-03-16 21:39:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:39:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:02,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:39:02,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:39:02,579 INFO L87 Difference]: Start difference. First operand 292 states and 417 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:02,977 INFO L93 Difference]: Finished difference Result 710 states and 1021 transitions. [2025-03-16 21:39:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:39:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 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 47 [2025-03-16 21:39:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:02,979 INFO L225 Difference]: With dead ends: 710 [2025-03-16 21:39:02,979 INFO L226 Difference]: Without dead ends: 453 [2025-03-16 21:39:02,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:39:02,981 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 715 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:02,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1429 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:39:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-16 21:39:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 297. [2025-03-16 21:39:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.429054054054054) internal successors, (423), 296 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 423 transitions. [2025-03-16 21:39:02,989 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 423 transitions. Word has length 47 [2025-03-16 21:39:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:02,989 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 423 transitions. [2025-03-16 21:39:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 423 transitions. [2025-03-16 21:39:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 21:39:02,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:02,989 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] [2025-03-16 21:39:02,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:39:02,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:02,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1732496109, now seen corresponding path program 1 times [2025-03-16 21:39:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462297552] [2025-03-16 21:39:02,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:03,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 21:39:03,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 21:39:03,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:03,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:03,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:03,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462297552] [2025-03-16 21:39:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462297552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 21:39:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839365357] [2025-03-16 21:39:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 21:39:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:03,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 21:39:03,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:39:03,397 INFO L87 Difference]: Start difference. First operand 297 states and 423 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:03,732 INFO L93 Difference]: Finished difference Result 557 states and 799 transitions. [2025-03-16 21:39:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:39:03,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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 47 [2025-03-16 21:39:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:03,734 INFO L225 Difference]: With dead ends: 557 [2025-03-16 21:39:03,734 INFO L226 Difference]: Without dead ends: 300 [2025-03-16 21:39:03,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:39:03,735 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 14 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:03,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2471 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:39:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-16 21:39:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2025-03-16 21:39:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4242424242424243) internal successors, (423), 297 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 423 transitions. [2025-03-16 21:39:03,742 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 423 transitions. Word has length 47 [2025-03-16 21:39:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:03,742 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 423 transitions. [2025-03-16 21:39:03,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 423 transitions. [2025-03-16 21:39:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 21:39:03,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:03,744 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] [2025-03-16 21:39:03,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:39:03,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:03,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1797764148, now seen corresponding path program 1 times [2025-03-16 21:39:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:03,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298399289] [2025-03-16 21:39:03,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:03,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 21:39:03,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 21:39:03,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:03,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298399289] [2025-03-16 21:39:04,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298399289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:04,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:04,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:39:04,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644538091] [2025-03-16 21:39:04,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:04,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:39:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:04,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:39:04,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:39:04,267 INFO L87 Difference]: Start difference. First operand 298 states and 423 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:04,658 INFO L93 Difference]: Finished difference Result 696 states and 998 transitions. [2025-03-16 21:39:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:39:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 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 48 [2025-03-16 21:39:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:04,660 INFO L225 Difference]: With dead ends: 696 [2025-03-16 21:39:04,660 INFO L226 Difference]: Without dead ends: 438 [2025-03-16 21:39:04,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:39:04,661 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 672 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:04,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1575 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:39:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-16 21:39:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 303. [2025-03-16 21:39:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4205298013245033) internal successors, (429), 302 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 429 transitions. [2025-03-16 21:39:04,668 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 429 transitions. Word has length 48 [2025-03-16 21:39:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:04,668 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 429 transitions. [2025-03-16 21:39:04,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 429 transitions. [2025-03-16 21:39:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 21:39:04,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:04,669 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] [2025-03-16 21:39:04,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:39:04,669 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:04,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -284406477, now seen corresponding path program 1 times [2025-03-16 21:39:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:04,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151761580] [2025-03-16 21:39:04,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:04,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 21:39:04,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 21:39:04,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:04,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:05,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151761580] [2025-03-16 21:39:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151761580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:05,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 21:39:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559108660] [2025-03-16 21:39:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:05,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 21:39:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:05,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 21:39:05,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:39:05,252 INFO L87 Difference]: Start difference. First operand 303 states and 429 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:05,857 INFO L93 Difference]: Finished difference Result 566 states and 808 transitions. [2025-03-16 21:39:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 21:39:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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 48 [2025-03-16 21:39:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:05,858 INFO L225 Difference]: With dead ends: 566 [2025-03-16 21:39:05,858 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 21:39:05,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:39:05,859 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 24 mSDsluCounter, 3655 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3902 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:05,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3902 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:39:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 21:39:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2025-03-16 21:39:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4191419141914192) internal successors, (430), 303 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2025-03-16 21:39:05,865 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 48 [2025-03-16 21:39:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:05,865 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2025-03-16 21:39:05,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2025-03-16 21:39:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 21:39:05,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:05,866 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] [2025-03-16 21:39:05,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:39:05,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:05,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1988130709, now seen corresponding path program 1 times [2025-03-16 21:39:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138167386] [2025-03-16 21:39:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:05,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 21:39:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 21:39:05,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138167386] [2025-03-16 21:39:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138167386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 21:39:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681393285] [2025-03-16 21:39:06,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:06,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 21:39:06,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:06,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 21:39:06,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:39:06,305 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:06,745 INFO L93 Difference]: Finished difference Result 567 states and 809 transitions. [2025-03-16 21:39:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:39:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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 48 [2025-03-16 21:39:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:06,746 INFO L225 Difference]: With dead ends: 567 [2025-03-16 21:39:06,746 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 21:39:06,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:39:06,747 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 19 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:06,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3197 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:39:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 21:39:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2025-03-16 21:39:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.4144736842105263) internal successors, (430), 304 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2025-03-16 21:39:06,753 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 430 transitions. Word has length 48 [2025-03-16 21:39:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:06,754 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 430 transitions. [2025-03-16 21:39:06,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 430 transitions. [2025-03-16 21:39:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 21:39:06,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:06,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:39:06,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:39:06,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:06,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash -557373940, now seen corresponding path program 1 times [2025-03-16 21:39:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801215281] [2025-03-16 21:39:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:06,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 21:39:07,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 21:39:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801215281] [2025-03-16 21:39:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801215281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212388958] [2025-03-16 21:39:09,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:09,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:09,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:09,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:39:09,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 21:39:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 21:39:09,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:09,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 21:39:09,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:10,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212388958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2025-03-16 21:39:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165589689] [2025-03-16 21:39:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:39:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:10,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:39:10,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-16 21:39:10,119 INFO L87 Difference]: Start difference. First operand 305 states and 430 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:10,584 INFO L93 Difference]: Finished difference Result 763 states and 1097 transitions. [2025-03-16 21:39:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:39:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 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 142 [2025-03-16 21:39:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:10,586 INFO L225 Difference]: With dead ends: 763 [2025-03-16 21:39:10,586 INFO L226 Difference]: Without dead ends: 503 [2025-03-16 21:39:10,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-16 21:39:10,587 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 972 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:10,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 686 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:39:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-16 21:39:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 333. [2025-03-16 21:39:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.4036144578313252) internal successors, (466), 332 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2025-03-16 21:39:10,593 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 142 [2025-03-16 21:39:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:10,594 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2025-03-16 21:39:10,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2025-03-16 21:39:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-16 21:39:10,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:10,595 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:10,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:39:10,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:10,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1933604189, now seen corresponding path program 1 times [2025-03-16 21:39:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202219565] [2025-03-16 21:39:10,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 21:39:11,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 21:39:11,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:11,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:11,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202219565] [2025-03-16 21:39:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202219565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:11,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410769355] [2025-03-16 21:39:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:11,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:39:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:11,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:39:11,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:11,973 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:12,275 INFO L93 Difference]: Finished difference Result 597 states and 847 transitions. [2025-03-16 21:39:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:39:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 5 states have internal predecessors, (143), 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 143 [2025-03-16 21:39:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:12,276 INFO L225 Difference]: With dead ends: 597 [2025-03-16 21:39:12,276 INFO L226 Difference]: Without dead ends: 337 [2025-03-16 21:39:12,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:12,277 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 259 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 657 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:39:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-16 21:39:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2025-03-16 21:39:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.4029850746268657) internal successors, (470), 335 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2025-03-16 21:39:12,283 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 143 [2025-03-16 21:39:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2025-03-16 21:39:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2025-03-16 21:39:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-16 21:39:12,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:12,285 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:39:12,285 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1784111582, now seen corresponding path program 1 times [2025-03-16 21:39:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749460989] [2025-03-16 21:39:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:12,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 21:39:12,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 21:39:12,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:12,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749460989] [2025-03-16 21:39:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749460989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453967540] [2025-03-16 21:39:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:14,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:14,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:14,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:14,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 21:39:14,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 21:39:15,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 21:39:15,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:15,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:15,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-16 21:39:15,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:15,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453967540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:15,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2025-03-16 21:39:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407694007] [2025-03-16 21:39:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:39:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:15,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:39:15,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-16 21:39:15,588 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:16,120 INFO L93 Difference]: Finished difference Result 767 states and 1100 transitions. [2025-03-16 21:39:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:39:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 7 states have internal predecessors, (143), 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 143 [2025-03-16 21:39:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:16,123 INFO L225 Difference]: With dead ends: 767 [2025-03-16 21:39:16,123 INFO L226 Difference]: Without dead ends: 504 [2025-03-16 21:39:16,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-03-16 21:39:16,125 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 846 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:16,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 761 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:39:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-16 21:39:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 362. [2025-03-16 21:39:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.4044321329639888) internal successors, (507), 361 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 507 transitions. [2025-03-16 21:39:16,133 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 507 transitions. Word has length 143 [2025-03-16 21:39:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:16,133 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 507 transitions. [2025-03-16 21:39:16,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 507 transitions. [2025-03-16 21:39:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 21:39:16,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:16,135 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:16,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 21:39:16,335 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,SelfDestructingSolverStorable21 [2025-03-16 21:39:16,335 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:16,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1904750688, now seen corresponding path program 1 times [2025-03-16 21:39:16,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:16,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107328551] [2025-03-16 21:39:16,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 21:39:16,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 21:39:16,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:16,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107328551] [2025-03-16 21:39:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107328551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143621779] [2025-03-16 21:39:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:39:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:17,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:39:17,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:17,224 INFO L87 Difference]: Start difference. First operand 362 states and 507 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:17,533 INFO L93 Difference]: Finished difference Result 629 states and 892 transitions. [2025-03-16 21:39:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:39:17,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 144 [2025-03-16 21:39:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:17,548 INFO L225 Difference]: With dead ends: 629 [2025-03-16 21:39:17,548 INFO L226 Difference]: Without dead ends: 366 [2025-03-16 21:39:17,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:17,549 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 249 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:17,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 657 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:39:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-16 21:39:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2025-03-16 21:39:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4038461538461537) internal successors, (511), 364 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 511 transitions. [2025-03-16 21:39:17,565 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 511 transitions. Word has length 144 [2025-03-16 21:39:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:17,565 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 511 transitions. [2025-03-16 21:39:17,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 511 transitions. [2025-03-16 21:39:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 21:39:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:17,566 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:39:17,566 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:17,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -180184219, now seen corresponding path program 1 times [2025-03-16 21:39:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769915657] [2025-03-16 21:39:17,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:17,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 21:39:17,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 21:39:17,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:17,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769915657] [2025-03-16 21:39:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769915657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:18,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:39:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485167839] [2025-03-16 21:39:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:18,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:39:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:18,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:39:18,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:39:18,653 INFO L87 Difference]: Start difference. First operand 365 states and 511 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:18,842 INFO L93 Difference]: Finished difference Result 727 states and 1037 transitions. [2025-03-16 21:39:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:39:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 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 144 [2025-03-16 21:39:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:18,844 INFO L225 Difference]: With dead ends: 727 [2025-03-16 21:39:18,844 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 21:39:18,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:39:18,845 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 466 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:18,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1039 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 21:39:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 377. [2025-03-16 21:39:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.4042553191489362) internal successors, (528), 376 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 528 transitions. [2025-03-16 21:39:18,850 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 528 transitions. Word has length 144 [2025-03-16 21:39:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:18,850 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 528 transitions. [2025-03-16 21:39:18,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 528 transitions. [2025-03-16 21:39:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 21:39:18,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:18,851 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:18,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:39:18,852 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:18,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -222530917, now seen corresponding path program 1 times [2025-03-16 21:39:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65466622] [2025-03-16 21:39:18,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 21:39:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 21:39:19,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:19,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65466622] [2025-03-16 21:39:21,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65466622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563395038] [2025-03-16 21:39:21,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:21,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:21,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 21:39:21,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 21:39:21,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 21:39:21,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:21,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:21,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-16 21:39:21,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:22,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563395038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:22,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 25 [2025-03-16 21:39:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613377221] [2025-03-16 21:39:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:22,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 21:39:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:22,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 21:39:22,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-03-16 21:39:22,558 INFO L87 Difference]: Start difference. First operand 377 states and 528 transitions. Second operand has 15 states, 15 states have (on average 9.6) internal successors, (144), 14 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:23,435 INFO L93 Difference]: Finished difference Result 811 states and 1156 transitions. [2025-03-16 21:39:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:39:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.6) internal successors, (144), 14 states have internal predecessors, (144), 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 144 [2025-03-16 21:39:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:23,437 INFO L225 Difference]: With dead ends: 811 [2025-03-16 21:39:23,437 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 21:39:23,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 21:39:23,438 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 833 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:23,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1688 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:39:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 21:39:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 419. [2025-03-16 21:39:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4090909090909092) internal successors, (589), 418 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 589 transitions. [2025-03-16 21:39:23,449 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 589 transitions. Word has length 144 [2025-03-16 21:39:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:23,449 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 589 transitions. [2025-03-16 21:39:23,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.6) internal successors, (144), 14 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 589 transitions. [2025-03-16 21:39:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 21:39:23,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:23,451 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:23,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 21:39:23,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:23,652 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:23,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash -788587099, now seen corresponding path program 1 times [2025-03-16 21:39:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:23,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853169231] [2025-03-16 21:39:23,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:23,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 21:39:24,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 21:39:24,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:25,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853169231] [2025-03-16 21:39:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853169231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026597427] [2025-03-16 21:39:25,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:25,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:25,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 21:39:26,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 21:39:26,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 21:39:26,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:26,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-16 21:39:26,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:26,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026597427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:26,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-16 21:39:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811106209] [2025-03-16 21:39:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:26,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:39:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:26,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:39:26,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-16 21:39:26,883 INFO L87 Difference]: Start difference. First operand 419 states and 589 transitions. Second operand has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:27,501 INFO L93 Difference]: Finished difference Result 944 states and 1349 transitions. [2025-03-16 21:39:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:39:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 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 144 [2025-03-16 21:39:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:27,503 INFO L225 Difference]: With dead ends: 944 [2025-03-16 21:39:27,504 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 21:39:27,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-03-16 21:39:27,504 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 645 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:27,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1232 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:39:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 21:39:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 487. [2025-03-16 21:39:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.4135802469135803) internal successors, (687), 486 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 687 transitions. [2025-03-16 21:39:27,513 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 687 transitions. Word has length 144 [2025-03-16 21:39:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:27,513 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 687 transitions. [2025-03-16 21:39:27,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 687 transitions. [2025-03-16 21:39:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 21:39:27,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:27,514 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:27,527 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-16 21:39:27,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 21:39:27,717 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash -899280265, now seen corresponding path program 1 times [2025-03-16 21:39:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185882064] [2025-03-16 21:39:27,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:27,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:28,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:28,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:28,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185882064] [2025-03-16 21:39:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185882064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306618881] [2025-03-16 21:39:30,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:30,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:30,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 21:39:30,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:31,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:31,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:31,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:31,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-16 21:39:31,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:31,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306618881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:31,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:31,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 22 [2025-03-16 21:39:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700458546] [2025-03-16 21:39:31,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:31,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:39:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:31,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:39:31,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-03-16 21:39:31,496 INFO L87 Difference]: Start difference. First operand 487 states and 687 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:32,036 INFO L93 Difference]: Finished difference Result 912 states and 1303 transitions. [2025-03-16 21:39:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:39:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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 145 [2025-03-16 21:39:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:32,038 INFO L225 Difference]: With dead ends: 912 [2025-03-16 21:39:32,039 INFO L226 Difference]: Without dead ends: 646 [2025-03-16 21:39:32,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-03-16 21:39:32,039 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 741 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:32,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1036 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:39:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-16 21:39:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 463. [2025-03-16 21:39:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.406926406926407) internal successors, (650), 462 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 650 transitions. [2025-03-16 21:39:32,046 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 650 transitions. Word has length 145 [2025-03-16 21:39:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:32,046 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 650 transitions. [2025-03-16 21:39:32,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 650 transitions. [2025-03-16 21:39:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 21:39:32,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:32,047 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:32,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 21:39:32,247 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,SelfDestructingSolverStorable26 [2025-03-16 21:39:32,248 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:32,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1162823964, now seen corresponding path program 1 times [2025-03-16 21:39:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:32,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055047050] [2025-03-16 21:39:32,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:32,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:32,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:32,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:32,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055047050] [2025-03-16 21:39:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055047050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:39:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052786034] [2025-03-16 21:39:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:32,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:39:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:39:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:32,989 INFO L87 Difference]: Start difference. First operand 463 states and 650 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:33,154 INFO L93 Difference]: Finished difference Result 734 states and 1040 transitions. [2025-03-16 21:39:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:39:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 145 [2025-03-16 21:39:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:33,156 INFO L225 Difference]: With dead ends: 734 [2025-03-16 21:39:33,156 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 21:39:33,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:39:33,157 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 2 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:33,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 823 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 21:39:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-03-16 21:39:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.4043478260869566) internal successors, (646), 460 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 646 transitions. [2025-03-16 21:39:33,165 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 646 transitions. Word has length 145 [2025-03-16 21:39:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:33,165 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 646 transitions. [2025-03-16 21:39:33,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 646 transitions. [2025-03-16 21:39:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 21:39:33,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:33,167 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:33,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:39:33,167 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:33,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash -69488953, now seen corresponding path program 1 times [2025-03-16 21:39:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084249080] [2025-03-16 21:39:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:33,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:33,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:33,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084249080] [2025-03-16 21:39:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084249080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:33,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:39:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984480217] [2025-03-16 21:39:33,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:39:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:33,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:39:33,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:39:33,490 INFO L87 Difference]: Start difference. First operand 461 states and 646 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:33,709 INFO L93 Difference]: Finished difference Result 990 states and 1403 transitions. [2025-03-16 21:39:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:39:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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 145 [2025-03-16 21:39:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:33,711 INFO L225 Difference]: With dead ends: 990 [2025-03-16 21:39:33,711 INFO L226 Difference]: Without dead ends: 477 [2025-03-16 21:39:33,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:39:33,712 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 141 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:33,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1428 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-16 21:39:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2025-03-16 21:39:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.3974358974358974) internal successors, (654), 468 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 654 transitions. [2025-03-16 21:39:33,716 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 654 transitions. Word has length 145 [2025-03-16 21:39:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:33,716 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 654 transitions. [2025-03-16 21:39:33,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 654 transitions. [2025-03-16 21:39:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 21:39:33,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:33,718 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:33,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:39:33,718 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:33,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1225856249, now seen corresponding path program 1 times [2025-03-16 21:39:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289919172] [2025-03-16 21:39:33,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:33,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:34,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:34,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:34,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289919172] [2025-03-16 21:39:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289919172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705246056] [2025-03-16 21:39:35,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:35,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:35,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:35,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:35,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 21:39:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:36,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:36,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:36,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 21:39:36,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:36,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705246056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-03-16 21:39:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570964847] [2025-03-16 21:39:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:36,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:39:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:36,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:39:36,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:39:36,750 INFO L87 Difference]: Start difference. First operand 469 states and 654 transitions. Second operand has 10 states, 10 states have (on average 14.5) internal successors, (145), 9 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:37,250 INFO L93 Difference]: Finished difference Result 875 states and 1239 transitions. [2025-03-16 21:39:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:39:37,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 9 states have internal predecessors, (145), 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 145 [2025-03-16 21:39:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:37,252 INFO L225 Difference]: With dead ends: 875 [2025-03-16 21:39:37,252 INFO L226 Difference]: Without dead ends: 608 [2025-03-16 21:39:37,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2025-03-16 21:39:37,253 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 459 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:37,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1341 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:39:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-16 21:39:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 574. [2025-03-16 21:39:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.406631762652705) internal successors, (806), 573 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 806 transitions. [2025-03-16 21:39:37,260 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 806 transitions. Word has length 145 [2025-03-16 21:39:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:37,260 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 806 transitions. [2025-03-16 21:39:37,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 9 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 806 transitions. [2025-03-16 21:39:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 21:39:37,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:37,261 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:37,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 21:39:37,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:37,462 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:37,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1143632278, now seen corresponding path program 1 times [2025-03-16 21:39:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:37,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897232434] [2025-03-16 21:39:37,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:37,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:37,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:37,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:37,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:38,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:38,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897232434] [2025-03-16 21:39:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897232434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:39:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:39:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303829688] [2025-03-16 21:39:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:38,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:39:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:38,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:39:38,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:39:38,408 INFO L87 Difference]: Start difference. First operand 574 states and 806 transitions. Second operand has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:38,638 INFO L93 Difference]: Finished difference Result 1087 states and 1551 transitions. [2025-03-16 21:39:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:39:38,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 8 states have internal predecessors, (145), 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 145 [2025-03-16 21:39:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:38,640 INFO L225 Difference]: With dead ends: 1087 [2025-03-16 21:39:38,640 INFO L226 Difference]: Without dead ends: 740 [2025-03-16 21:39:38,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:39:38,641 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 720 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:38,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1157 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:39:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-16 21:39:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 630. [2025-03-16 21:39:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 1.4085850556438793) internal successors, (886), 629 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 886 transitions. [2025-03-16 21:39:38,648 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 886 transitions. Word has length 145 [2025-03-16 21:39:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:38,648 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 886 transitions. [2025-03-16 21:39:38,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 886 transitions. [2025-03-16 21:39:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 21:39:38,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:38,649 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:39:38,649 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1621595099, now seen corresponding path program 1 times [2025-03-16 21:39:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055447052] [2025-03-16 21:39:38,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:38,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:39,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:41,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055447052] [2025-03-16 21:39:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055447052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193512238] [2025-03-16 21:39:41,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:41,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:39:41,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 21:39:42,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 21:39:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 21:39:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:42,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-16 21:39:42,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:43,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193512238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-03-16 21:39:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072586280] [2025-03-16 21:39:43,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:43,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:39:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:43,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:39:43,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:39:43,060 INFO L87 Difference]: Start difference. First operand 630 states and 886 transitions. Second operand has 10 states, 10 states have (on average 14.5) internal successors, (145), 9 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:43,754 INFO L93 Difference]: Finished difference Result 1146 states and 1632 transitions. [2025-03-16 21:39:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:39:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 9 states have internal predecessors, (145), 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 145 [2025-03-16 21:39:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:43,756 INFO L225 Difference]: With dead ends: 1146 [2025-03-16 21:39:43,756 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 21:39:43,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-03-16 21:39:43,757 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 791 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:43,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1147 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:39:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 21:39:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 633. [2025-03-16 21:39:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4098101265822784) internal successors, (891), 632 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 891 transitions. [2025-03-16 21:39:43,765 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 891 transitions. Word has length 145 [2025-03-16 21:39:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:43,766 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 891 transitions. [2025-03-16 21:39:43,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 9 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 891 transitions. [2025-03-16 21:39:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 21:39:43,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:43,767 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:43,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 21:39:43,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:43,967 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:43,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash -309083555, now seen corresponding path program 1 times [2025-03-16 21:39:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514397601] [2025-03-16 21:39:43,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:44,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 21:39:44,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 21:39:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:39:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514397601] [2025-03-16 21:39:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514397601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636611037] [2025-03-16 21:39:46,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:46,090 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-16 21:39:46,091 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-16 21:39:46,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 21:39:46,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 21:39:46,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:46,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:46,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-16 21:39:46,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:47,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:39:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636611037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:39:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:39:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2025-03-16 21:39:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438140919] [2025-03-16 21:39:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:39:47,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:39:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:47,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:39:47,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:39:47,058 INFO L87 Difference]: Start difference. First operand 633 states and 891 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 8 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-16 21:39:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:47,498 INFO L93 Difference]: Finished difference Result 1180 states and 1682 transitions. [2025-03-16 21:39:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:39:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 8 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-16 21:39:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:47,500 INFO L225 Difference]: With dead ends: 1180 [2025-03-16 21:39:47,500 INFO L226 Difference]: Without dead ends: 745 [2025-03-16 21:39:47,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:39:47,501 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 621 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:47,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1009 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:39:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-16 21:39:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 639. [2025-03-16 21:39:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 1.4059561128526645) internal successors, (897), 638 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 897 transitions. [2025-03-16 21:39:47,510 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 897 transitions. Word has length 146 [2025-03-16 21:39:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:47,510 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 897 transitions. [2025-03-16 21:39:47,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 8 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-16 21:39:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 897 transitions. [2025-03-16 21:39:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 21:39:47,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:47,511 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:47,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 21:39:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 21:39:47,713 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1020281558, now seen corresponding path program 1 times [2025-03-16 21:39:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937419592] [2025-03-16 21:39:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:47,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 21:39:48,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 21:39:48,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:39:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937419592] [2025-03-16 21:39:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937419592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:39:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599236053] [2025-03-16 21:39:50,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:39:50,147 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-16 21:39:50,148 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-16 21:39:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 21:39:50,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 21:39:50,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:50,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:39:50,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-16 21:39:50,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:39:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:51,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:39:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:39:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599236053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:39:53,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:39:53,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 21] total 57 [2025-03-16 21:39:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831035811] [2025-03-16 21:39:53,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:39:53,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-16 21:39:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:39:53,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-16 21:39:53,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2896, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 21:39:53,495 INFO L87 Difference]: Start difference. First operand 639 states and 897 transitions. Second operand has 58 states, 58 states have (on average 6.620689655172414) internal successors, (384), 57 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:39:58,027 INFO L93 Difference]: Finished difference Result 2581 states and 3636 transitions. [2025-03-16 21:39:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 21:39:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 6.620689655172414) internal successors, (384), 57 states have internal predecessors, (384), 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-16 21:39:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:39:58,032 INFO L225 Difference]: With dead ends: 2581 [2025-03-16 21:39:58,033 INFO L226 Difference]: Without dead ends: 2234 [2025-03-16 21:39:58,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1618, Invalid=14384, Unknown=0, NotChecked=0, Total=16002 [2025-03-16 21:39:58,037 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 2763 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 8573 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 6494 SdHoareTripleChecker+Invalid, 8608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 8573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:39:58,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 6494 Invalid, 8608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 8573 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 21:39:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2025-03-16 21:39:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1137. [2025-03-16 21:39:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.4163732394366197) internal successors, (1609), 1136 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1609 transitions. [2025-03-16 21:39:58,051 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1609 transitions. Word has length 146 [2025-03-16 21:39:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:39:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1609 transitions. [2025-03-16 21:39:58,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 6.620689655172414) internal successors, (384), 57 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:39:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1609 transitions. [2025-03-16 21:39:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 21:39:58,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:39:58,053 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 21:39:58,064 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-16 21:39:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:39:58,253 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:39:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:39:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash 420488751, now seen corresponding path program 1 times [2025-03-16 21:39:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:39:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296189413] [2025-03-16 21:39:58,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:39:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:39:58,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 21:39:58,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 21:39:58,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:39:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:40:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 21:40:00,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:40:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296189413] [2025-03-16 21:40:00,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296189413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:40:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841623215] [2025-03-16 21:40:00,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:40:00,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:40:00,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:40:00,206 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-16 21:40:00,207 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-16 21:40:00,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 21:40:01,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 21:40:01,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:40:01,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:40:01,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-16 21:40:01,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:40:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:40:02,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:40:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:40:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841623215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:40:03,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:40:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26, 21] total 56 [2025-03-16 21:40:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030789407] [2025-03-16 21:40:03,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:40:03,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 21:40:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:40:03,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 21:40:03,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2822, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 21:40:03,800 INFO L87 Difference]: Start difference. First operand 1137 states and 1609 transitions. Second operand has 57 states, 57 states have (on average 6.754385964912281) internal successors, (385), 56 states have internal predecessors, (385), 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)