./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.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.sw_state_machine.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 9e75acc5dea77a52694df76103c51840072f3a9cdbcfeb4df332aef49d637e9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:36:50,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:36:50,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:36:50,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:36:50,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:36:50,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:36:50,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:36:50,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:36:50,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:36:50,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:36:50,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:36:50,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:36:50,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:36:50,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:36:50,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:36:50,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:36:50,088 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 -> 9e75acc5dea77a52694df76103c51840072f3a9cdbcfeb4df332aef49d637e9f [2025-03-16 22:36:50,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:36:50,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:36:50,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:36:50,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:36:50,326 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:36:50,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2025-03-16 22:36:51,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f11f7f41/bbace381d6e04665b1e492950de25182/FLAG8dbe9832e [2025-03-16 22:36:51,762 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:36:51,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2025-03-16 22:36:51,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f11f7f41/bbace381d6e04665b1e492950de25182/FLAG8dbe9832e [2025-03-16 22:36:51,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f11f7f41/bbace381d6e04665b1e492950de25182 [2025-03-16 22:36:51,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:36:51,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:36:51,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:36:51,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:36:51,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:36:51,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:36:51" (1/1) ... [2025-03-16 22:36:51,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:51, skipping insertion in model container [2025-03-16 22:36:51,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:36:51" (1/1) ... [2025-03-16 22:36:51,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:36:51,962 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.sw_state_machine.c[1256,1269] [2025-03-16 22:36:52,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:36:52,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:36:52,166 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.sw_state_machine.c[1256,1269] [2025-03-16 22:36:52,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:36:52,264 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:36:52,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52 WrapperNode [2025-03-16 22:36:52,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:36:52,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:36:52,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:36:52,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:36:52,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,441 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1678 [2025-03-16 22:36:52,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:36:52,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:36:52,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:36:52,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:36:52,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,557 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 22:36:52,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:36:52,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:36:52,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:36:52,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:36:52,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (1/1) ... [2025-03-16 22:36:52,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:36:52,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:36:52,710 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 22:36:52,714 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 22:36:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:36:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:36:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:36:52,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:36:52,888 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:36:52,890 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:36:54,190 INFO L? ?]: Removed 1066 outVars from TransFormulas that were not future-live. [2025-03-16 22:36:54,191 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:36:54,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:36:54,271 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:36:54,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:36:54 BoogieIcfgContainer [2025-03-16 22:36:54,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:36:54,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:36:54,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:36:54,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:36:54,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:36:51" (1/3) ... [2025-03-16 22:36:54,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655272a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:36:54, skipping insertion in model container [2025-03-16 22:36:54,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:52" (2/3) ... [2025-03-16 22:36:54,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655272a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:36:54, skipping insertion in model container [2025-03-16 22:36:54,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:36:54" (3/3) ... [2025-03-16 22:36:54,281 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_state_machine.c [2025-03-16 22:36:54,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:36:54,294 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_state_machine.c that has 1 procedures, 496 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:36:54,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:36:54,358 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;@399a4e12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:36:54,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:36:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 496 states, 494 states have (on average 1.5) internal successors, (741), 495 states have internal predecessors, (741), 0 states have call successors, (0), 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 22:36:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 22:36:54,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:54,367 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] [2025-03-16 22:36:54,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:54,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1291783755, now seen corresponding path program 1 times [2025-03-16 22:36:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918304088] [2025-03-16 22:36:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 22:36:54,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 22:36:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:54,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:54,821 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 22:36:54,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:54,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918304088] [2025-03-16 22:36:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918304088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346116997] [2025-03-16 22:36:54,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:54,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:36:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:54,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:36:54,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:54,846 INFO L87 Difference]: Start difference. First operand has 496 states, 494 states have (on average 1.5) internal successors, (741), 495 states have internal predecessors, (741), 0 states have call successors, (0), 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 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 22:36:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:55,139 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2025-03-16 22:36:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:36:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 22:36:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:55,147 INFO L225 Difference]: With dead ends: 943 [2025-03-16 22:36:55,148 INFO L226 Difference]: Without dead ends: 496 [2025-03-16 22:36:55,154 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 22:36:55,156 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:55,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1837 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-16 22:36:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-16 22:36:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.494949494949495) internal successors, (740), 495 states have internal predecessors, (740), 0 states have call successors, (0), 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 22:36:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 740 transitions. [2025-03-16 22:36:55,197 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 740 transitions. Word has length 32 [2025-03-16 22:36:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 740 transitions. [2025-03-16 22:36:55,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 22:36:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 740 transitions. [2025-03-16 22:36:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 22:36:55,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:55,200 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] [2025-03-16 22:36:55,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:36:55,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:55,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1385910842, now seen corresponding path program 1 times [2025-03-16 22:36:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:55,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902021490] [2025-03-16 22:36:55,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:55,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:36:55,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:36:55,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:55,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:55,338 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 22:36:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902021490] [2025-03-16 22:36:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902021490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:55,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:55,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58974996] [2025-03-16 22:36:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:55,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:36:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:55,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:36:55,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:55,341 INFO L87 Difference]: Start difference. First operand 496 states and 740 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 22:36:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:55,567 INFO L93 Difference]: Finished difference Result 945 states and 1410 transitions. [2025-03-16 22:36:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:36:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-16 22:36:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:55,570 INFO L225 Difference]: With dead ends: 945 [2025-03-16 22:36:55,570 INFO L226 Difference]: Without dead ends: 498 [2025-03-16 22:36:55,571 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 22:36:55,571 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:55,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1834 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-16 22:36:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-16 22:36:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.4929577464788732) internal successors, (742), 497 states have internal predecessors, (742), 0 states have call successors, (0), 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 22:36:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 742 transitions. [2025-03-16 22:36:55,594 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 742 transitions. Word has length 33 [2025-03-16 22:36:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:55,595 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 742 transitions. [2025-03-16 22:36:55,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 22:36:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 742 transitions. [2025-03-16 22:36:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 22:36:55,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:55,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] [2025-03-16 22:36:55,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:36:55,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:55,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1917946832, now seen corresponding path program 1 times [2025-03-16 22:36:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:55,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511639336] [2025-03-16 22:36:55,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:55,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:55,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:36:55,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:36:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:55,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:55,809 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 22:36:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511639336] [2025-03-16 22:36:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511639336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102739549] [2025-03-16 22:36:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:55,810 INFO L87 Difference]: Start difference. First operand 498 states and 742 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 22:36:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:56,138 INFO L93 Difference]: Finished difference Result 1354 states and 2019 transitions. [2025-03-16 22:36:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 22:36:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:56,141 INFO L225 Difference]: With dead ends: 1354 [2025-03-16 22:36:56,141 INFO L226 Difference]: Without dead ends: 905 [2025-03-16 22:36:56,142 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 22:36:56,142 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 1927 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:56,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1927 Valid, 1800 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:36:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-16 22:36:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 500. [2025-03-16 22:36:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.4909819639278556) internal successors, (744), 499 states have internal predecessors, (744), 0 states have call successors, (0), 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 22:36:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 744 transitions. [2025-03-16 22:36:56,159 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 744 transitions. Word has length 34 [2025-03-16 22:36:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:56,159 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 744 transitions. [2025-03-16 22:36:56,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 22:36:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 744 transitions. [2025-03-16 22:36:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 22:36:56,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:56,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:56,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:36:56,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2009735526, now seen corresponding path program 1 times [2025-03-16 22:36:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266531171] [2025-03-16 22:36:56,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:56,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 22:36:57,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 22:36:57,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:57,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:58,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266531171] [2025-03-16 22:36:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266531171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:36:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349238009] [2025-03-16 22:36:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:58,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:36:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:58,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:36:58,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:36:58,608 INFO L87 Difference]: Start difference. First operand 500 states and 744 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 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 22:36:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:59,158 INFO L93 Difference]: Finished difference Result 1338 states and 1994 transitions. [2025-03-16 22:36:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:36:59,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-03-16 22:36:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:59,163 INFO L225 Difference]: With dead ends: 1338 [2025-03-16 22:36:59,163 INFO L226 Difference]: Without dead ends: 889 [2025-03-16 22:36:59,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:36:59,165 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1874 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:59,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 3585 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:36:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-16 22:36:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 528. [2025-03-16 22:36:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.4857685009487667) internal successors, (783), 527 states have internal predecessors, (783), 0 states have call successors, (0), 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 22:36:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 783 transitions. [2025-03-16 22:36:59,182 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 783 transitions. Word has length 257 [2025-03-16 22:36:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:59,184 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 783 transitions. [2025-03-16 22:36:59,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 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 22:36:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 783 transitions. [2025-03-16 22:36:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 22:36:59,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:59,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:59,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:36:59,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:59,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1250897308, now seen corresponding path program 1 times [2025-03-16 22:36:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:59,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633245574] [2025-03-16 22:36:59,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:59,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 22:36:59,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 22:36:59,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:59,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:59,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633245574] [2025-03-16 22:36:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633245574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:59,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:36:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964440993] [2025-03-16 22:36:59,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:59,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:36:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:59,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:36:59,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:36:59,935 INFO L87 Difference]: Start difference. First operand 528 states and 783 transitions. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 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 22:37:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:00,287 INFO L93 Difference]: Finished difference Result 1389 states and 2069 transitions. [2025-03-16 22:37:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:00,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-03-16 22:37:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:00,291 INFO L225 Difference]: With dead ends: 1389 [2025-03-16 22:37:00,292 INFO L226 Difference]: Without dead ends: 940 [2025-03-16 22:37:00,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:00,295 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2606 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:00,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2606 Valid, 1794 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-16 22:37:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 535. [2025-03-16 22:37:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4812734082397003) internal successors, (791), 534 states have internal predecessors, (791), 0 states have call successors, (0), 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 22:37:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 791 transitions. [2025-03-16 22:37:00,315 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 791 transitions. Word has length 258 [2025-03-16 22:37:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:00,316 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 791 transitions. [2025-03-16 22:37:00,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 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 22:37:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 791 transitions. [2025-03-16 22:37:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 22:37:00,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:00,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:00,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:37:00,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1648433257, now seen corresponding path program 1 times [2025-03-16 22:37:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464258618] [2025-03-16 22:37:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:00,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:00,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 22:37:01,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 22:37:01,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:01,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464258618] [2025-03-16 22:37:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464258618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820770743] [2025-03-16 22:37:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:37:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:37:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:01,446 INFO L87 Difference]: Start difference. First operand 535 states and 791 transitions. Second operand has 8 states, 8 states have (on average 32.25) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 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 22:37:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:01,947 INFO L93 Difference]: Finished difference Result 1354 states and 2012 transitions. [2025-03-16 22:37:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:37:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-03-16 22:37:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:01,950 INFO L225 Difference]: With dead ends: 1354 [2025-03-16 22:37:01,950 INFO L226 Difference]: Without dead ends: 889 [2025-03-16 22:37:01,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:37:01,952 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1884 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:01,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 3586 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:37:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-16 22:37:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 528. [2025-03-16 22:37:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.4800759013282732) internal successors, (780), 527 states have internal predecessors, (780), 0 states have call successors, (0), 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 22:37:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 780 transitions. [2025-03-16 22:37:01,962 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 780 transitions. Word has length 258 [2025-03-16 22:37:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:01,962 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 780 transitions. [2025-03-16 22:37:01,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 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 22:37:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 780 transitions. [2025-03-16 22:37:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 22:37:01,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:01,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:37:01,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:01,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash 174893289, now seen corresponding path program 1 times [2025-03-16 22:37:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205418615] [2025-03-16 22:37:01,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:02,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 22:37:02,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 22:37:02,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:02,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:03,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:03,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205418615] [2025-03-16 22:37:03,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205418615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:03,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:03,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478948474] [2025-03-16 22:37:03,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:03,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:03,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:03,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:03,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:03,713 INFO L87 Difference]: Start difference. First operand 528 states and 780 transitions. Second operand has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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 22:37:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:04,069 INFO L93 Difference]: Finished difference Result 1322 states and 1966 transitions. [2025-03-16 22:37:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-03-16 22:37:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:04,072 INFO L225 Difference]: With dead ends: 1322 [2025-03-16 22:37:04,072 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:04,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:04,074 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2260 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:04,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 1758 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 694. [2025-03-16 22:37:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.4834054834054835) internal successors, (1028), 693 states have internal predecessors, (1028), 0 states have call successors, (0), 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 22:37:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1028 transitions. [2025-03-16 22:37:04,089 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1028 transitions. Word has length 259 [2025-03-16 22:37:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1028 transitions. [2025-03-16 22:37:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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 22:37:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1028 transitions. [2025-03-16 22:37:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 22:37:04,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:04,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:04,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:37:04,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:04,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1108463220, now seen corresponding path program 1 times [2025-03-16 22:37:04,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:04,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303576770] [2025-03-16 22:37:04,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:04,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 22:37:04,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 22:37:04,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:04,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303576770] [2025-03-16 22:37:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303576770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773956188] [2025-03-16 22:37:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:05,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:05,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:05,235 INFO L87 Difference]: Start difference. First operand 694 states and 1028 transitions. Second operand has 5 states, 5 states have (on average 52.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 22:37:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:05,561 INFO L93 Difference]: Finished difference Result 1424 states and 2117 transitions. [2025-03-16 22:37:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-03-16 22:37:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:05,564 INFO L225 Difference]: With dead ends: 1424 [2025-03-16 22:37:05,565 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:05,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 22:37:05,566 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1767 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:05,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 1793 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 694. [2025-03-16 22:37:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.4805194805194806) internal successors, (1026), 693 states have internal predecessors, (1026), 0 states have call successors, (0), 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 22:37:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1026 transitions. [2025-03-16 22:37:05,579 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1026 transitions. Word has length 260 [2025-03-16 22:37:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:05,579 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1026 transitions. [2025-03-16 22:37:05,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 22:37:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1026 transitions. [2025-03-16 22:37:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 22:37:05,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:05,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:05,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:37:05,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:05,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1319496281, now seen corresponding path program 1 times [2025-03-16 22:37:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926378222] [2025-03-16 22:37:05,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 22:37:06,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 22:37:06,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:06,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926378222] [2025-03-16 22:37:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926378222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:06,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440978958] [2025-03-16 22:37:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:06,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:06,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:06,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:06,701 INFO L87 Difference]: Start difference. First operand 694 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 52.4) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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 22:37:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:07,034 INFO L93 Difference]: Finished difference Result 1356 states and 2013 transitions. [2025-03-16 22:37:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-03-16 22:37:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:07,038 INFO L225 Difference]: With dead ends: 1356 [2025-03-16 22:37:07,038 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:07,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 22:37:07,039 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1729 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1792 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 694. [2025-03-16 22:37:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.479076479076479) internal successors, (1025), 693 states have internal predecessors, (1025), 0 states have call successors, (0), 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 22:37:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1025 transitions. [2025-03-16 22:37:07,052 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1025 transitions. Word has length 262 [2025-03-16 22:37:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:07,052 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1025 transitions. [2025-03-16 22:37:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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 22:37:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1025 transitions. [2025-03-16 22:37:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 22:37:07,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:07,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:37:07,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:07,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1862517289, now seen corresponding path program 1 times [2025-03-16 22:37:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601872875] [2025-03-16 22:37:07,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:07,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 22:37:07,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 22:37:07,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:07,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601872875] [2025-03-16 22:37:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601872875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:08,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866991802] [2025-03-16 22:37:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:08,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:08,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:08,332 INFO L87 Difference]: Start difference. First operand 694 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 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 22:37:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:08,699 INFO L93 Difference]: Finished difference Result 1322 states and 1962 transitions. [2025-03-16 22:37:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:08,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-03-16 22:37:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:08,703 INFO L225 Difference]: With dead ends: 1322 [2025-03-16 22:37:08,703 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:08,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:08,704 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2244 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2244 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:08,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2244 Valid, 1793 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 695. [2025-03-16 22:37:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.478386167146974) internal successors, (1026), 694 states have internal predecessors, (1026), 0 states have call successors, (0), 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 22:37:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1026 transitions. [2025-03-16 22:37:08,719 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1026 transitions. Word has length 263 [2025-03-16 22:37:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:08,720 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1026 transitions. [2025-03-16 22:37:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 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 22:37:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1026 transitions. [2025-03-16 22:37:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-16 22:37:08,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:08,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:08,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:37:08,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:08,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1408851482, now seen corresponding path program 1 times [2025-03-16 22:37:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:08,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338993735] [2025-03-16 22:37:08,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:08,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 22:37:09,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 22:37:09,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:09,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338993735] [2025-03-16 22:37:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338993735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:37:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651088646] [2025-03-16 22:37:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:10,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:37:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:10,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:37:10,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:10,047 INFO L87 Difference]: Start difference. First operand 695 states and 1026 transitions. Second operand has 11 states, 11 states have (on average 24.0) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:10,768 INFO L93 Difference]: Finished difference Result 1485 states and 2201 transitions. [2025-03-16 22:37:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:37:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.0) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-03-16 22:37:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:10,771 INFO L225 Difference]: With dead ends: 1485 [2025-03-16 22:37:10,771 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:10,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:37:10,773 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1805 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 4672 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:10,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1805 Valid, 4672 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:37:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 695. [2025-03-16 22:37:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4769452449567724) internal successors, (1025), 694 states have internal predecessors, (1025), 0 states have call successors, (0), 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 22:37:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1025 transitions. [2025-03-16 22:37:10,785 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1025 transitions. Word has length 264 [2025-03-16 22:37:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:10,785 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1025 transitions. [2025-03-16 22:37:10,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.0) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1025 transitions. [2025-03-16 22:37:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 22:37:10,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:10,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:37:10,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1569961296, now seen corresponding path program 1 times [2025-03-16 22:37:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561317441] [2025-03-16 22:37:10,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 22:37:11,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 22:37:11,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:11,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561317441] [2025-03-16 22:37:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561317441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693490676] [2025-03-16 22:37:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:11,812 INFO L87 Difference]: Start difference. First operand 695 states and 1025 transitions. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 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 22:37:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:12,134 INFO L93 Difference]: Finished difference Result 1322 states and 1960 transitions. [2025-03-16 22:37:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2025-03-16 22:37:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:12,137 INFO L225 Difference]: With dead ends: 1322 [2025-03-16 22:37:12,138 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:12,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 22:37:12,139 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1665 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:12,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 1792 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 766. [2025-03-16 22:37:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.477124183006536) internal successors, (1130), 765 states have internal predecessors, (1130), 0 states have call successors, (0), 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 22:37:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1130 transitions. [2025-03-16 22:37:12,153 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1130 transitions. Word has length 265 [2025-03-16 22:37:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:12,154 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1130 transitions. [2025-03-16 22:37:12,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 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 22:37:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1130 transitions. [2025-03-16 22:37:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 22:37:12,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:12,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:12,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:37:12,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:12,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2095564513, now seen corresponding path program 1 times [2025-03-16 22:37:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239401747] [2025-03-16 22:37:12,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:12,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 22:37:12,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 22:37:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:12,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239401747] [2025-03-16 22:37:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239401747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834887715] [2025-03-16 22:37:13,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:13,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:13,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:13,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:13,258 INFO L87 Difference]: Start difference. First operand 766 states and 1130 transitions. Second operand has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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 22:37:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:13,662 INFO L93 Difference]: Finished difference Result 1386 states and 2055 transitions. [2025-03-16 22:37:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-03-16 22:37:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:13,666 INFO L225 Difference]: With dead ends: 1386 [2025-03-16 22:37:13,666 INFO L226 Difference]: Without dead ends: 937 [2025-03-16 22:37:13,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:13,667 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1853 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:13,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 2816 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:37:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-16 22:37:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 769. [2025-03-16 22:37:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.4765625) internal successors, (1134), 768 states have internal predecessors, (1134), 0 states have call successors, (0), 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 22:37:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1134 transitions. [2025-03-16 22:37:13,681 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1134 transitions. Word has length 266 [2025-03-16 22:37:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,682 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1134 transitions. [2025-03-16 22:37:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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 22:37:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1134 transitions. [2025-03-16 22:37:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 22:37:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:37:13,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -82809483, now seen corresponding path program 1 times [2025-03-16 22:37:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552659001] [2025-03-16 22:37:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 22:37:14,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 22:37:14,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552659001] [2025-03-16 22:37:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552659001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902453663] [2025-03-16 22:37:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:14,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:14,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:14,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:14,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:14,771 INFO L87 Difference]: Start difference. First operand 769 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 22:37:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:15,117 INFO L93 Difference]: Finished difference Result 1324 states and 1961 transitions. [2025-03-16 22:37:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2025-03-16 22:37:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:15,119 INFO L225 Difference]: With dead ends: 1324 [2025-03-16 22:37:15,119 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:15,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:15,121 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1796 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:15,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 2392 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-03-16 22:37:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4765013054830287) internal successors, (1131), 766 states have internal predecessors, (1131), 0 states have call successors, (0), 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 22:37:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1131 transitions. [2025-03-16 22:37:15,133 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1131 transitions. Word has length 267 [2025-03-16 22:37:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1131 transitions. [2025-03-16 22:37:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 22:37:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1131 transitions. [2025-03-16 22:37:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 22:37:15,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:15,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:37:15,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:15,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash 908195603, now seen corresponding path program 1 times [2025-03-16 22:37:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513711803] [2025-03-16 22:37:15,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:15,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 22:37:15,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 22:37:15,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:15,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513711803] [2025-03-16 22:37:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513711803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:16,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:16,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870372395] [2025-03-16 22:37:16,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:16,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:16,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:16,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:16,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:16,187 INFO L87 Difference]: Start difference. First operand 767 states and 1131 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 22:37:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:16,546 INFO L93 Difference]: Finished difference Result 1429 states and 2115 transitions. [2025-03-16 22:37:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2025-03-16 22:37:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:16,549 INFO L225 Difference]: With dead ends: 1429 [2025-03-16 22:37:16,549 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:16,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:16,551 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1794 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:16,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 2392 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-03-16 22:37:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.475195822454308) internal successors, (1130), 766 states have internal predecessors, (1130), 0 states have call successors, (0), 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 22:37:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1130 transitions. [2025-03-16 22:37:16,563 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1130 transitions. Word has length 267 [2025-03-16 22:37:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:16,563 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1130 transitions. [2025-03-16 22:37:16,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 22:37:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1130 transitions. [2025-03-16 22:37:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 22:37:16,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:16,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:37:16,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash -100406976, now seen corresponding path program 1 times [2025-03-16 22:37:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053809510] [2025-03-16 22:37:16,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:16,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 22:37:17,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 22:37:17,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053809510] [2025-03-16 22:37:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053809510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:17,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:17,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846842625] [2025-03-16 22:37:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:17,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:17,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:17,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:17,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:17,979 INFO L87 Difference]: Start difference. First operand 767 states and 1130 transitions. Second operand has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 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 22:37:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:18,337 INFO L93 Difference]: Finished difference Result 1357 states and 2008 transitions. [2025-03-16 22:37:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-03-16 22:37:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:18,340 INFO L225 Difference]: With dead ends: 1357 [2025-03-16 22:37:18,340 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:18,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:18,341 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1793 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:18,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2391 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-03-16 22:37:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4738903394255876) internal successors, (1129), 766 states have internal predecessors, (1129), 0 states have call successors, (0), 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 22:37:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1129 transitions. [2025-03-16 22:37:18,350 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1129 transitions. Word has length 268 [2025-03-16 22:37:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:18,351 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1129 transitions. [2025-03-16 22:37:18,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 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 22:37:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1129 transitions. [2025-03-16 22:37:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 22:37:18,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:18,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:37:18,352 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 484688296, now seen corresponding path program 1 times [2025-03-16 22:37:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524075466] [2025-03-16 22:37:18,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:18,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 22:37:18,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 22:37:18,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:18,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:19,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:19,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524075466] [2025-03-16 22:37:19,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524075466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:19,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:19,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886211729] [2025-03-16 22:37:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:19,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:19,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:19,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:19,359 INFO L87 Difference]: Start difference. First operand 767 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:19,627 INFO L93 Difference]: Finished difference Result 1357 states and 2007 transitions. [2025-03-16 22:37:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2025-03-16 22:37:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:19,629 INFO L225 Difference]: With dead ends: 1357 [2025-03-16 22:37:19,629 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:19,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:19,630 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2204 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:19,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 1793 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-03-16 22:37:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4725848563968669) internal successors, (1128), 766 states have internal predecessors, (1128), 0 states have call successors, (0), 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 22:37:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1128 transitions. [2025-03-16 22:37:19,639 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1128 transitions. Word has length 269 [2025-03-16 22:37:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1128 transitions. [2025-03-16 22:37:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1128 transitions. [2025-03-16 22:37:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-16 22:37:19,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:19,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:19,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:37:19,640 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1357571006, now seen corresponding path program 1 times [2025-03-16 22:37:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389446999] [2025-03-16 22:37:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:19,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-16 22:37:20,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-16 22:37:20,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:20,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:20,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:20,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389446999] [2025-03-16 22:37:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389446999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:20,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:20,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:20,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093094855] [2025-03-16 22:37:20,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:20,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:20,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:20,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:20,857 INFO L87 Difference]: Start difference. First operand 767 states and 1128 transitions. Second operand has 5 states, 5 states have (on average 54.0) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:21,135 INFO L93 Difference]: Finished difference Result 1641 states and 2419 transitions. [2025-03-16 22:37:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2025-03-16 22:37:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:21,137 INFO L225 Difference]: With dead ends: 1641 [2025-03-16 22:37:21,137 INFO L226 Difference]: Without dead ends: 933 [2025-03-16 22:37:21,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 22:37:21,138 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1975 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:21,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 1797 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-16 22:37:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 767. [2025-03-16 22:37:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4712793733681462) internal successors, (1127), 766 states have internal predecessors, (1127), 0 states have call successors, (0), 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 22:37:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1127 transitions. [2025-03-16 22:37:21,147 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1127 transitions. Word has length 270 [2025-03-16 22:37:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:21,147 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1127 transitions. [2025-03-16 22:37:21,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1127 transitions. [2025-03-16 22:37:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 22:37:21,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:21,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:37:21,149 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:21,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1294475407, now seen corresponding path program 1 times [2025-03-16 22:37:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22977226] [2025-03-16 22:37:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:21,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 22:37:21,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 22:37:21,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:21,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:22,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22977226] [2025-03-16 22:37:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22977226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:22,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:22,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:22,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828841581] [2025-03-16 22:37:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:22,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:22,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:22,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:22,090 INFO L87 Difference]: Start difference. First operand 767 states and 1127 transitions. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 22:37:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:22,303 INFO L93 Difference]: Finished difference Result 1641 states and 2418 transitions. [2025-03-16 22:37:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-03-16 22:37:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:22,306 INFO L225 Difference]: With dead ends: 1641 [2025-03-16 22:37:22,306 INFO L226 Difference]: Without dead ends: 933 [2025-03-16 22:37:22,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:22,307 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1340 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1807 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 22:37:22,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1807 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-16 22:37:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 767. [2025-03-16 22:37:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4699738903394255) internal successors, (1126), 766 states have internal predecessors, (1126), 0 states have call successors, (0), 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 22:37:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1126 transitions. [2025-03-16 22:37:22,315 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1126 transitions. Word has length 271 [2025-03-16 22:37:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:22,315 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1126 transitions. [2025-03-16 22:37:22,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 22:37:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1126 transitions. [2025-03-16 22:37:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-16 22:37:22,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:22,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:22,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:37:22,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:22,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash 547310605, now seen corresponding path program 1 times [2025-03-16 22:37:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196157897] [2025-03-16 22:37:22,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:22,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-16 22:37:23,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-16 22:37:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:23,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196157897] [2025-03-16 22:37:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196157897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:23,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:23,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655336753] [2025-03-16 22:37:23,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:23,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:23,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:23,706 INFO L87 Difference]: Start difference. First operand 767 states and 1126 transitions. Second operand has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 22:37:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:23,974 INFO L93 Difference]: Finished difference Result 1322 states and 1953 transitions. [2025-03-16 22:37:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:23,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-03-16 22:37:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:23,977 INFO L225 Difference]: With dead ends: 1322 [2025-03-16 22:37:23,977 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 22:37:23,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:23,978 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1783 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:23,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2391 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 22:37:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 802. [2025-03-16 22:37:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 1.4694132334581773) internal successors, (1177), 801 states have internal predecessors, (1177), 0 states have call successors, (0), 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 22:37:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1177 transitions. [2025-03-16 22:37:23,986 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1177 transitions. Word has length 272 [2025-03-16 22:37:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:23,986 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1177 transitions. [2025-03-16 22:37:23,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 22:37:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1177 transitions. [2025-03-16 22:37:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-16 22:37:23,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:23,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:23,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:37:23,988 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:23,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash 118802287, now seen corresponding path program 1 times [2025-03-16 22:37:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:23,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169305620] [2025-03-16 22:37:23,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:24,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 22:37:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 22:37:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:25,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169305620] [2025-03-16 22:37:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169305620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371883633] [2025-03-16 22:37:25,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:25,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:25,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:25,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:25,175 INFO L87 Difference]: Start difference. First operand 802 states and 1177 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 22:37:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:25,491 INFO L93 Difference]: Finished difference Result 1386 states and 2048 transitions. [2025-03-16 22:37:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-03-16 22:37:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:25,493 INFO L225 Difference]: With dead ends: 1386 [2025-03-16 22:37:25,493 INFO L226 Difference]: Without dead ends: 937 [2025-03-16 22:37:25,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:25,495 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1813 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:25,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 2976 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-16 22:37:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 805. [2025-03-16 22:37:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4689054726368158) internal successors, (1181), 804 states have internal predecessors, (1181), 0 states have call successors, (0), 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 22:37:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1181 transitions. [2025-03-16 22:37:25,502 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1181 transitions. Word has length 273 [2025-03-16 22:37:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:25,503 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1181 transitions. [2025-03-16 22:37:25,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 22:37:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1181 transitions. [2025-03-16 22:37:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-16 22:37:25,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:25,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:25,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 22:37:25,504 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:25,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:25,505 INFO L85 PathProgramCache]: Analyzing trace with hash -367432238, now seen corresponding path program 1 times [2025-03-16 22:37:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:25,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003853509] [2025-03-16 22:37:25,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:25,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-16 22:37:26,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-16 22:37:26,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:26,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:26,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003853509] [2025-03-16 22:37:26,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003853509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:26,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:26,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592720455] [2025-03-16 22:37:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:26,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:26,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:26,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:26,754 INFO L87 Difference]: Start difference. First operand 805 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 22:37:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:27,078 INFO L93 Difference]: Finished difference Result 1336 states and 1972 transitions. [2025-03-16 22:37:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-03-16 22:37:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:27,083 INFO L225 Difference]: With dead ends: 1336 [2025-03-16 22:37:27,083 INFO L226 Difference]: Without dead ends: 887 [2025-03-16 22:37:27,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:27,085 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1654 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:27,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2982 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-16 22:37:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 811. [2025-03-16 22:37:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.4679012345679012) internal successors, (1189), 810 states have internal predecessors, (1189), 0 states have call successors, (0), 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 22:37:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1189 transitions. [2025-03-16 22:37:27,094 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1189 transitions. Word has length 274 [2025-03-16 22:37:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:27,095 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1189 transitions. [2025-03-16 22:37:27,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 22:37:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1189 transitions. [2025-03-16 22:37:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-16 22:37:27,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:27,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 22:37:27,097 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:27,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1873461464, now seen corresponding path program 1 times [2025-03-16 22:37:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263523888] [2025-03-16 22:37:27,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:27,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-16 22:37:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-16 22:37:27,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:28,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263523888] [2025-03-16 22:37:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263523888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445708837] [2025-03-16 22:37:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:28,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:28,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:28,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:28,524 INFO L87 Difference]: Start difference. First operand 811 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 22:37:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:28,764 INFO L93 Difference]: Finished difference Result 1326 states and 1956 transitions. [2025-03-16 22:37:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-03-16 22:37:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:28,766 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 22:37:28,766 INFO L226 Difference]: Without dead ends: 877 [2025-03-16 22:37:28,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:28,767 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 2129 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:28,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 1792 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-16 22:37:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 842. [2025-03-16 22:37:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4673008323424495) internal successors, (1234), 841 states have internal predecessors, (1234), 0 states have call successors, (0), 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 22:37:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1234 transitions. [2025-03-16 22:37:28,774 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1234 transitions. Word has length 274 [2025-03-16 22:37:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:28,775 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1234 transitions. [2025-03-16 22:37:28,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 22:37:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1234 transitions. [2025-03-16 22:37:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-16 22:37:28,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:28,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:28,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 22:37:28,776 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:28,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1063037617, now seen corresponding path program 1 times [2025-03-16 22:37:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:28,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833329459] [2025-03-16 22:37:28,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:28,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-16 22:37:29,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-16 22:37:29,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:29,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:30,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833329459] [2025-03-16 22:37:30,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833329459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:30,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:30,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:30,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790261260] [2025-03-16 22:37:30,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:30,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:37:30,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:30,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:37:30,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:30,387 INFO L87 Difference]: Start difference. First operand 842 states and 1234 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 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 22:37:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:30,755 INFO L93 Difference]: Finished difference Result 1390 states and 2051 transitions. [2025-03-16 22:37:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-03-16 22:37:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:30,758 INFO L225 Difference]: With dead ends: 1390 [2025-03-16 22:37:30,758 INFO L226 Difference]: Without dead ends: 941 [2025-03-16 22:37:30,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:30,759 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1957 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 3576 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:30,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 3576 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-16 22:37:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 845. [2025-03-16 22:37:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.466824644549763) internal successors, (1238), 844 states have internal predecessors, (1238), 0 states have call successors, (0), 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 22:37:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1238 transitions. [2025-03-16 22:37:30,767 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1238 transitions. Word has length 275 [2025-03-16 22:37:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:30,767 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1238 transitions. [2025-03-16 22:37:30,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 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 22:37:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1238 transitions. [2025-03-16 22:37:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-16 22:37:30,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:30,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:30,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 22:37:30,769 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:30,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2109966147, now seen corresponding path program 1 times [2025-03-16 22:37:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501559452] [2025-03-16 22:37:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:30,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-16 22:37:31,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-16 22:37:31,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:31,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501559452] [2025-03-16 22:37:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501559452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:32,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:32,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260546853] [2025-03-16 22:37:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:32,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:37:32,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:32,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:37:32,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:32,279 INFO L87 Difference]: Start difference. First operand 845 states and 1238 transitions. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:32,616 INFO L93 Difference]: Finished difference Result 1340 states and 1975 transitions. [2025-03-16 22:37:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-03-16 22:37:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:32,618 INFO L225 Difference]: With dead ends: 1340 [2025-03-16 22:37:32,618 INFO L226 Difference]: Without dead ends: 891 [2025-03-16 22:37:32,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:32,619 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1259 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:32,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 3583 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-16 22:37:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 851. [2025-03-16 22:37:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.4658823529411764) internal successors, (1246), 850 states have internal predecessors, (1246), 0 states have call successors, (0), 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 22:37:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1246 transitions. [2025-03-16 22:37:32,627 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1246 transitions. Word has length 276 [2025-03-16 22:37:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:32,627 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1246 transitions. [2025-03-16 22:37:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1246 transitions. [2025-03-16 22:37:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-16 22:37:32,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:32,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:32,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 22:37:32,629 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:32,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1043080615, now seen corresponding path program 1 times [2025-03-16 22:37:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528673383] [2025-03-16 22:37:32,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:32,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-16 22:37:33,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-16 22:37:33,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528673383] [2025-03-16 22:37:33,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528673383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524926632] [2025-03-16 22:37:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:33,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:33,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:33,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:33,673 INFO L87 Difference]: Start difference. First operand 851 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:33,922 INFO L93 Difference]: Finished difference Result 1333 states and 1964 transitions. [2025-03-16 22:37:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:33,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-03-16 22:37:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:33,925 INFO L225 Difference]: With dead ends: 1333 [2025-03-16 22:37:33,925 INFO L226 Difference]: Without dead ends: 884 [2025-03-16 22:37:33,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:33,926 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1588 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:33,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 1789 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-16 22:37:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2025-03-16 22:37:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4653802497162316) internal successors, (1291), 881 states have internal predecessors, (1291), 0 states have call successors, (0), 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 22:37:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1291 transitions. [2025-03-16 22:37:33,936 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1291 transitions. Word has length 276 [2025-03-16 22:37:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:33,936 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1291 transitions. [2025-03-16 22:37:33,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1291 transitions. [2025-03-16 22:37:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 22:37:33,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:33,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:33,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 22:37:33,939 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1494343599, now seen corresponding path program 1 times [2025-03-16 22:37:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622050163] [2025-03-16 22:37:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 22:37:34,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 22:37:34,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:34,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:35,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:35,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622050163] [2025-03-16 22:37:35,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622050163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:35,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:35,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54941627] [2025-03-16 22:37:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:35,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:37:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:35,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:37:35,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:35,396 INFO L87 Difference]: Start difference. First operand 882 states and 1291 transitions. Second operand has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 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 22:37:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:35,704 INFO L93 Difference]: Finished difference Result 1394 states and 2054 transitions. [2025-03-16 22:37:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2025-03-16 22:37:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:35,707 INFO L225 Difference]: With dead ends: 1394 [2025-03-16 22:37:35,707 INFO L226 Difference]: Without dead ends: 945 [2025-03-16 22:37:35,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:35,707 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2374 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:35,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2798 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-16 22:37:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 885. [2025-03-16 22:37:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4649321266968325) internal successors, (1295), 884 states have internal predecessors, (1295), 0 states have call successors, (0), 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 22:37:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1295 transitions. [2025-03-16 22:37:35,715 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1295 transitions. Word has length 277 [2025-03-16 22:37:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:35,715 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1295 transitions. [2025-03-16 22:37:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 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 22:37:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1295 transitions. [2025-03-16 22:37:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-16 22:37:35,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:35,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:35,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 22:37:35,716 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 127990444, now seen corresponding path program 1 times [2025-03-16 22:37:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:35,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427000980] [2025-03-16 22:37:35,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:35,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-16 22:37:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-16 22:37:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427000980] [2025-03-16 22:37:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427000980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:36,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189964835] [2025-03-16 22:37:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:36,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:36,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:36,753 INFO L87 Difference]: Start difference. First operand 885 states and 1295 transitions. Second operand has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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 22:37:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:37,053 INFO L93 Difference]: Finished difference Result 1344 states and 1978 transitions. [2025-03-16 22:37:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2025-03-16 22:37:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:37,056 INFO L225 Difference]: With dead ends: 1344 [2025-03-16 22:37:37,056 INFO L226 Difference]: Without dead ends: 895 [2025-03-16 22:37:37,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:37,056 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1605 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:37,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 2979 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-16 22:37:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2025-03-16 22:37:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.4640449438202248) internal successors, (1303), 890 states have internal predecessors, (1303), 0 states have call successors, (0), 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 22:37:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1303 transitions. [2025-03-16 22:37:37,064 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1303 transitions. Word has length 278 [2025-03-16 22:37:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:37,064 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1303 transitions. [2025-03-16 22:37:37,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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 22:37:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1303 transitions. [2025-03-16 22:37:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-16 22:37:37,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:37,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:37,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 22:37:37,065 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 450720252, now seen corresponding path program 1 times [2025-03-16 22:37:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:37,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214335071] [2025-03-16 22:37:37,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:37,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-16 22:37:37,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-16 22:37:37,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214335071] [2025-03-16 22:37:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214335071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:38,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881034351] [2025-03-16 22:37:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:38,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:38,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:38,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:38,665 INFO L87 Difference]: Start difference. First operand 891 states and 1303 transitions. Second operand has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 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 22:37:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:38,957 INFO L93 Difference]: Finished difference Result 1749 states and 2566 transitions. [2025-03-16 22:37:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:38,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2025-03-16 22:37:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:38,960 INFO L225 Difference]: With dead ends: 1749 [2025-03-16 22:37:38,960 INFO L226 Difference]: Without dead ends: 945 [2025-03-16 22:37:38,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:38,961 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2554 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:38,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2554 Valid, 1798 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-16 22:37:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 891. [2025-03-16 22:37:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.4617977528089887) internal successors, (1301), 890 states have internal predecessors, (1301), 0 states have call successors, (0), 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 22:37:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1301 transitions. [2025-03-16 22:37:38,969 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1301 transitions. Word has length 278 [2025-03-16 22:37:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:38,969 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1301 transitions. [2025-03-16 22:37:38,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 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 22:37:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1301 transitions. [2025-03-16 22:37:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-16 22:37:38,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:38,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:38,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 22:37:38,970 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -797967916, now seen corresponding path program 1 times [2025-03-16 22:37:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716319166] [2025-03-16 22:37:38,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:39,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-16 22:37:39,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-16 22:37:39,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:39,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:40,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:40,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716319166] [2025-03-16 22:37:40,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716319166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:40,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601498332] [2025-03-16 22:37:40,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:40,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:40,840 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 22:37:40,841 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 22:37:41,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-16 22:37:41,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-16 22:37:41,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:41,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:41,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 22:37:41,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:42,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601498332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:43,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-03-16 22:37:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959915222] [2025-03-16 22:37:43,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:43,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 22:37:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:43,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 22:37:43,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-03-16 22:37:43,895 INFO L87 Difference]: Start difference. First operand 891 states and 1301 transitions. Second operand has 28 states, 28 states have (on average 29.642857142857142) internal successors, (830), 27 states have internal predecessors, (830), 0 states have call successors, (0), 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 22:37:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:45,576 INFO L93 Difference]: Finished difference Result 2609 states and 3818 transitions. [2025-03-16 22:37:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 22:37:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 29.642857142857142) internal successors, (830), 27 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2025-03-16 22:37:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:45,580 INFO L225 Difference]: With dead ends: 2609 [2025-03-16 22:37:45,580 INFO L226 Difference]: Without dead ends: 1784 [2025-03-16 22:37:45,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-03-16 22:37:45,581 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 7888 mSDsluCounter, 12806 mSDsCounter, 0 mSdLazyCounter, 4899 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7888 SdHoareTripleChecker+Valid, 13790 SdHoareTripleChecker+Invalid, 4901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:45,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7888 Valid, 13790 Invalid, 4901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4899 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 22:37:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-16 22:37:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1325. [2025-03-16 22:37:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.4531722054380665) internal successors, (1924), 1324 states have internal predecessors, (1924), 0 states have call successors, (0), 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 22:37:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1924 transitions. [2025-03-16 22:37:45,599 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1924 transitions. Word has length 280 [2025-03-16 22:37:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:45,599 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1924 transitions. [2025-03-16 22:37:45,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 29.642857142857142) internal successors, (830), 27 states have internal predecessors, (830), 0 states have call successors, (0), 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 22:37:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1924 transitions. [2025-03-16 22:37:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 22:37:45,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:45,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:45,613 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 22:37:45,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:45,802 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -806528189, now seen corresponding path program 1 times [2025-03-16 22:37:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972042290] [2025-03-16 22:37:45,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 22:37:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 22:37:45,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972042290] [2025-03-16 22:37:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972042290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138677598] [2025-03-16 22:37:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:46,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:46,207 INFO L87 Difference]: Start difference. First operand 1325 states and 1924 transitions. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 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 22:37:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:46,421 INFO L93 Difference]: Finished difference Result 2171 states and 3162 transitions. [2025-03-16 22:37:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2025-03-16 22:37:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:46,424 INFO L225 Difference]: With dead ends: 2171 [2025-03-16 22:37:46,424 INFO L226 Difference]: Without dead ends: 1344 [2025-03-16 22:37:46,424 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 22:37:46,425 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 1276 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:46,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1801 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-03-16 22:37:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1322. [2025-03-16 22:37:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 1.4519303557910674) internal successors, (1918), 1321 states have internal predecessors, (1918), 0 states have call successors, (0), 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 22:37:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1918 transitions. [2025-03-16 22:37:46,435 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1918 transitions. Word has length 281 [2025-03-16 22:37:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:46,435 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1918 transitions. [2025-03-16 22:37:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 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 22:37:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1918 transitions. [2025-03-16 22:37:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 22:37:46,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:46,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:46,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 22:37:46,437 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:46,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1349551912, now seen corresponding path program 1 times [2025-03-16 22:37:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:46,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396043293] [2025-03-16 22:37:46,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:46,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 22:37:46,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 22:37:46,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:46,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:46,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:46,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396043293] [2025-03-16 22:37:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396043293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:46,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:46,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:46,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165774186] [2025-03-16 22:37:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:46,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:46,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:46,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:46,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:46,843 INFO L87 Difference]: Start difference. First operand 1322 states and 1918 transitions. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 5 states have internal predecessors, (281), 0 states have call successors, (0), 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 22:37:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:47,125 INFO L93 Difference]: Finished difference Result 1771 states and 2587 transitions. [2025-03-16 22:37:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 5 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2025-03-16 22:37:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:47,126 INFO L225 Difference]: With dead ends: 1771 [2025-03-16 22:37:47,126 INFO L226 Difference]: Without dead ends: 943 [2025-03-16 22:37:47,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:47,127 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1763 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:47,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 2393 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-16 22:37:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2025-03-16 22:37:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.459660297239915) internal successors, (1375), 942 states have internal predecessors, (1375), 0 states have call successors, (0), 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 22:37:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1375 transitions. [2025-03-16 22:37:47,136 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1375 transitions. Word has length 281 [2025-03-16 22:37:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:47,137 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1375 transitions. [2025-03-16 22:37:47,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 5 states have internal predecessors, (281), 0 states have call successors, (0), 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 22:37:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1375 transitions. [2025-03-16 22:37:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-16 22:37:47,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:47,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:47,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 22:37:47,139 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:47,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1934815210, now seen corresponding path program 1 times [2025-03-16 22:37:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160575648] [2025-03-16 22:37:47,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:47,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-16 22:37:52,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-16 22:37:52,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:52,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 227 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160575648] [2025-03-16 22:37:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160575648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861956117] [2025-03-16 22:37:54,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:54,924 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 22:37:54,924 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 22:37:55,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-16 22:37:55,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-16 22:37:55,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:55,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:55,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 3253 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-16 22:37:55,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 209 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:57,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:38:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 202 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:01,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861956117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:38:01,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:38:01,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20, 22] total 46 [2025-03-16 22:38:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891735328] [2025-03-16 22:38:01,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:38:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-16 22:38:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:38:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-16 22:38:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1982, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 22:38:01,082 INFO L87 Difference]: Start difference. First operand 943 states and 1375 transitions. Second operand has 47 states, 47 states have (on average 27.659574468085108) internal successors, (1300), 46 states have internal predecessors, (1300), 0 states have call successors, (0), 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 22:38:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:38:08,553 INFO L93 Difference]: Finished difference Result 3925 states and 5784 transitions. [2025-03-16 22:38:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-16 22:38:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 27.659574468085108) internal successors, (1300), 46 states have internal predecessors, (1300), 0 states have call successors, (0), 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 503 [2025-03-16 22:38:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:38:08,558 INFO L225 Difference]: With dead ends: 3925 [2025-03-16 22:38:08,558 INFO L226 Difference]: Without dead ends: 3476 [2025-03-16 22:38:08,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1069 GetRequests, 965 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=955, Invalid=10175, Unknown=0, NotChecked=0, Total=11130 [2025-03-16 22:38:08,561 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 10176 mSDsluCounter, 40932 mSDsCounter, 0 mSdLazyCounter, 17046 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10176 SdHoareTripleChecker+Valid, 42341 SdHoareTripleChecker+Invalid, 17078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 17046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:38:08,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10176 Valid, 42341 Invalid, 17078 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 17046 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-16 22:38:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2025-03-16 22:38:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 2299. [2025-03-16 22:38:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2298 states have (on average 1.4577893820713663) internal successors, (3350), 2298 states have internal predecessors, (3350), 0 states have call successors, (0), 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 22:38:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3350 transitions. [2025-03-16 22:38:08,576 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3350 transitions. Word has length 503 [2025-03-16 22:38:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:38:08,576 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 3350 transitions. [2025-03-16 22:38:08,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 27.659574468085108) internal successors, (1300), 46 states have internal predecessors, (1300), 0 states have call successors, (0), 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 22:38:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3350 transitions. [2025-03-16 22:38:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-16 22:38:08,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:38:08,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:38:08,595 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 22:38:08,780 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,SelfDestructingSolverStorable32 [2025-03-16 22:38:08,780 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:38:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:38:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1845096382, now seen corresponding path program 1 times [2025-03-16 22:38:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:38:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991056317] [2025-03-16 22:38:08,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:38:08,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes.