./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6e4197d0572096f9d487e671de9ba1541e800c13a9d5ac01008d7630fe3cd68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:49:30,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:49:30,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:49:30,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:49:30,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:49:30,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:49:30,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:49:30,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:49:30,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:49:30,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:49:30,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:49:30,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:49:30,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:49:30,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:49:30,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:49:30,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:49:30,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:30,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:49:30,087 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a6e4197d0572096f9d487e671de9ba1541e800c13a9d5ac01008d7630fe3cd68 [2025-03-03 10:49:30,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:49:30,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:49:30,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:49:30,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:49:30,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:49:30,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2025-03-03 10:49:31,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade07377/0761222b53774c8eb530ef7d8ae843f5/FLAG5782362f4 [2025-03-03 10:49:31,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:49:31,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2025-03-03 10:49:31,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade07377/0761222b53774c8eb530ef7d8ae843f5/FLAG5782362f4 [2025-03-03 10:49:31,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade07377/0761222b53774c8eb530ef7d8ae843f5 [2025-03-03 10:49:31,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:49:31,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:49:31,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:31,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:49:31,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:49:31,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:31" (1/1) ... [2025-03-03 10:49:31,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f8552d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:31, skipping insertion in model container [2025-03-03 10:49:31,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:31" (1/1) ... [2025-03-03 10:49:31,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:49:32,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label12.c[7168,7181] [2025-03-03 10:49:32,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:32,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:49:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label12.c[7168,7181] [2025-03-03 10:49:32,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:32,461 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:49:32,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32 WrapperNode [2025-03-03 10:49:32,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:32,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:32,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:49:32,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:49:32,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,628 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:49:32,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:32,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:49:32,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:49:32,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:49:32,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:49:32,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:49:32,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:49:32,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:49:32,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:49:32,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (1/1) ... [2025-03-03 10:49:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:32,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:49:32,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:49:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:49:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:49:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:49:32,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:49:32,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:49:32,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:49:34,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:49:34,786 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:49:34,787 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:49:34,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:49:34,806 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:49:34,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:34 BoogieIcfgContainer [2025-03-03 10:49:34,807 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:49:34,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:49:34,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:49:34,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:49:34,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:49:31" (1/3) ... [2025-03-03 10:49:34,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5747a0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:34, skipping insertion in model container [2025-03-03 10:49:34,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:32" (2/3) ... [2025-03-03 10:49:34,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5747a0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:34, skipping insertion in model container [2025-03-03 10:49:34,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:34" (3/3) ... [2025-03-03 10:49:34,814 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label12.c [2025-03-03 10:49:34,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:49:34,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label12.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:49:34,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:49:34,907 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;@79baa5fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:49:34,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:49:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 10:49:34,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:34,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:34,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1868540168, now seen corresponding path program 1 times [2025-03-03 10:49:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342530293] [2025-03-03 10:49:34,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:34,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 10:49:35,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 10:49:35,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:35,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:35,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:35,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342530293] [2025-03-03 10:49:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342530293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:35,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278425877] [2025-03-03 10:49:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:35,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:35,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:35,218 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:36,817 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-03-03 10:49:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 10:49:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:36,829 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 10:49:36,829 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 10:49:36,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:36,834 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 262 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:36,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 385 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:49:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 10:49:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-03 10:49:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-03-03 10:49:36,876 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 59 [2025-03-03 10:49:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-03-03 10:49:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-03-03 10:49:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 10:49:36,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:36,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:36,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:49:36,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:36,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:36,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1303379621, now seen corresponding path program 1 times [2025-03-03 10:49:36,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:36,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121908423] [2025-03-03 10:49:36,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:36,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 10:49:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 10:49:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:37,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:37,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121908423] [2025-03-03 10:49:37,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121908423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:37,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:37,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020127991] [2025-03-03 10:49:37,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:37,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:37,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:37,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:37,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:37,250 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:38,330 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-03-03 10:49:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 10:49:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:38,333 INFO L225 Difference]: With dead ends: 1624 [2025-03-03 10:49:38,333 INFO L226 Difference]: Without dead ends: 963 [2025-03-03 10:49:38,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:38,337 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:38,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-03 10:49:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-03-03 10:49:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-03-03 10:49:38,376 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 124 [2025-03-03 10:49:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-03-03 10:49:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-03-03 10:49:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 10:49:38,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:38,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:38,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:49:38,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:38,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1276225650, now seen corresponding path program 1 times [2025-03-03 10:49:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:38,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074658863] [2025-03-03 10:49:38,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:38,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 10:49:38,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 10:49:38,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074658863] [2025-03-03 10:49:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074658863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:38,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:38,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:49:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561330302] [2025-03-03 10:49:38,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:38,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:49:38,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:38,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:49:38,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:49:38,651 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:39,984 INFO L93 Difference]: Finished difference Result 2240 states and 3197 transitions. [2025-03-03 10:49:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:39,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-03 10:49:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:39,991 INFO L225 Difference]: With dead ends: 2240 [2025-03-03 10:49:39,991 INFO L226 Difference]: Without dead ends: 1578 [2025-03-03 10:49:39,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:49:39,996 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 934 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:39,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 326 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:49:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-03 10:49:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266. [2025-03-03 10:49:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-03-03 10:49:40,021 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 129 [2025-03-03 10:49:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-03-03 10:49:40,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-03-03 10:49:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 10:49:40,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:40,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:49:40,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:49:40,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1359672805, now seen corresponding path program 1 times [2025-03-03 10:49:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:40,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706481166] [2025-03-03 10:49:40,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:40,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 10:49:40,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 10:49:40,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:40,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706481166] [2025-03-03 10:49:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706481166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:40,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:40,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912206496] [2025-03-03 10:49:40,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:40,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:49:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:40,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:49:40,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:49:40,229 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:42,381 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-03-03 10:49:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-03 10:49:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:42,390 INFO L225 Difference]: With dead ends: 4670 [2025-03-03 10:49:42,391 INFO L226 Difference]: Without dead ends: 3406 [2025-03-03 10:49:42,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:49:42,392 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 486 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:42,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 377 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:49:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-03-03 10:49:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-03-03 10:49:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-03-03 10:49:42,436 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 225 [2025-03-03 10:49:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-03-03 10:49:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-03-03 10:49:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 10:49:42,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:42,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:49:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:49:42,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1939228955, now seen corresponding path program 1 times [2025-03-03 10:49:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755897217] [2025-03-03 10:49:42,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:42,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 10:49:42,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 10:49:42,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:42,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:49:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755897217] [2025-03-03 10:49:42,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755897217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:42,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:42,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091892929] [2025-03-03 10:49:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:42,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:42,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:42,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:42,601 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:43,781 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-03-03 10:49:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:43,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 229 [2025-03-03 10:49:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:43,793 INFO L225 Difference]: With dead ends: 8563 [2025-03-03 10:49:43,793 INFO L226 Difference]: Without dead ends: 5483 [2025-03-03 10:49:43,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:43,797 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:43,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 340 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-03-03 10:49:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-03-03 10:49:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-03-03 10:49:43,885 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 229 [2025-03-03 10:49:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:43,886 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-03-03 10:49:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-03-03 10:49:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-03 10:49:43,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:43,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:49:43,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -920822041, now seen corresponding path program 1 times [2025-03-03 10:49:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:43,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396956901] [2025-03-03 10:49:43,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:43,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-03 10:49:43,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-03 10:49:43,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:43,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 10:49:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:44,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396956901] [2025-03-03 10:49:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396956901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:44,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624602416] [2025-03-03 10:49:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:44,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:44,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:44,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:44,340 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 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-03 10:49:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:45,330 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-03-03 10:49:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 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 331 [2025-03-03 10:49:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:45,341 INFO L225 Difference]: With dead ends: 10655 [2025-03-03 10:49:45,341 INFO L226 Difference]: Without dead ends: 5478 [2025-03-03 10:49:45,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:45,345 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:45,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-03-03 10:49:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-03-03 10:49:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-03-03 10:49:45,414 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 331 [2025-03-03 10:49:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:45,414 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-03-03 10:49:45,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 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-03 10:49:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-03-03 10:49:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 10:49:45,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:45,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:45,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:49:45,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:45,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash 980845688, now seen corresponding path program 1 times [2025-03-03 10:49:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:45,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682998287] [2025-03-03 10:49:45,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:45,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 10:49:45,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 10:49:45,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:45,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:49:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682998287] [2025-03-03 10:49:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682998287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:45,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035874371] [2025-03-03 10:49:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:45,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:45,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:45,610 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 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-03 10:49:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:46,905 INFO L93 Difference]: Finished difference Result 11851 states and 14151 transitions. [2025-03-03 10:49:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 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 346 [2025-03-03 10:49:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:46,919 INFO L225 Difference]: With dead ends: 11851 [2025-03-03 10:49:46,919 INFO L226 Difference]: Without dead ends: 6674 [2025-03-03 10:49:46,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:46,924 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:46,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 324 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:49:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-03-03 10:49:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2025-03-03 10:49:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1805128205128206) internal successors, (5755), 4875 states have internal predecessors, (5755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5755 transitions. [2025-03-03 10:49:46,993 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5755 transitions. Word has length 346 [2025-03-03 10:49:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:46,993 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5755 transitions. [2025-03-03 10:49:46,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 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-03 10:49:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5755 transitions. [2025-03-03 10:49:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-03 10:49:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:46,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:46,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:49:46,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1269811245, now seen corresponding path program 1 times [2025-03-03 10:49:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983255396] [2025-03-03 10:49:46,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:47,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-03 10:49:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-03 10:49:47,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:47,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:49:47,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:47,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983255396] [2025-03-03 10:49:47,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983255396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633386008] [2025-03-03 10:49:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:47,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:47,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:47,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:47,345 INFO L87 Difference]: Start difference. First operand 4876 states and 5755 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:48,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:48,503 INFO L93 Difference]: Finished difference Result 11264 states and 13492 transitions. [2025-03-03 10:49:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 405 [2025-03-03 10:49:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:48,517 INFO L225 Difference]: With dead ends: 11264 [2025-03-03 10:49:48,517 INFO L226 Difference]: Without dead ends: 6689 [2025-03-03 10:49:48,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:48,521 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 278 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:48,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 548 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2025-03-03 10:49:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6082. [2025-03-03 10:49:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6082 states, 6081 states have (on average 1.1782601545798388) internal successors, (7165), 6081 states have internal predecessors, (7165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 7165 transitions. [2025-03-03 10:49:48,586 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 7165 transitions. Word has length 405 [2025-03-03 10:49:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:48,587 INFO L471 AbstractCegarLoop]: Abstraction has 6082 states and 7165 transitions. [2025-03-03 10:49:48,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 7165 transitions. [2025-03-03 10:49:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-03 10:49:48,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:48,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:48,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:49:48,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash -579667443, now seen corresponding path program 1 times [2025-03-03 10:49:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:48,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111517396] [2025-03-03 10:49:48,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:48,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-03 10:49:48,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-03 10:49:48,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:48,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:48,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111517396] [2025-03-03 10:49:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111517396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:48,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978857960] [2025-03-03 10:49:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:48,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:48,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:48,831 INFO L87 Difference]: Start difference. First operand 6082 states and 7165 transitions. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:49,812 INFO L93 Difference]: Finished difference Result 14863 states and 17794 transitions. [2025-03-03 10:49:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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 411 [2025-03-03 10:49:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:49,825 INFO L225 Difference]: With dead ends: 14863 [2025-03-03 10:49:49,825 INFO L226 Difference]: Without dead ends: 9082 [2025-03-03 10:49:49,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:49,831 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 241 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:49,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 640 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2025-03-03 10:49:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 8181. [2025-03-03 10:49:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8181 states, 8180 states have (on average 1.154156479217604) internal successors, (9441), 8180 states have internal predecessors, (9441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 9441 transitions. [2025-03-03 10:49:49,900 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 9441 transitions. Word has length 411 [2025-03-03 10:49:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:49,900 INFO L471 AbstractCegarLoop]: Abstraction has 8181 states and 9441 transitions. [2025-03-03 10:49:49,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 9441 transitions. [2025-03-03 10:49:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-03 10:49:49,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:49,904 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:49,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:49:49,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:49,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1095512903, now seen corresponding path program 1 times [2025-03-03 10:49:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834701566] [2025-03-03 10:49:49,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:49,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-03 10:49:49,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-03 10:49:49,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:49,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:49:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834701566] [2025-03-03 10:49:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834701566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:50,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795367611] [2025-03-03 10:49:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:50,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:50,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:50,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:50,115 INFO L87 Difference]: Start difference. First operand 8181 states and 9441 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:51,162 INFO L93 Difference]: Finished difference Result 19052 states and 22353 transitions. [2025-03-03 10:49:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:51,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2025-03-03 10:49:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:51,177 INFO L225 Difference]: With dead ends: 19052 [2025-03-03 10:49:51,177 INFO L226 Difference]: Without dead ends: 11172 [2025-03-03 10:49:51,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:51,181 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 246 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:51,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11172 states. [2025-03-03 10:49:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11172 to 10869. [2025-03-03 10:49:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10869 states, 10868 states have (on average 1.1345233713654765) internal successors, (12330), 10868 states have internal predecessors, (12330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 12330 transitions. [2025-03-03 10:49:51,261 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 12330 transitions. Word has length 428 [2025-03-03 10:49:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:51,262 INFO L471 AbstractCegarLoop]: Abstraction has 10869 states and 12330 transitions. [2025-03-03 10:49:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 12330 transitions. [2025-03-03 10:49:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-03 10:49:51,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:51,267 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:51,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:49:51,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1821830139, now seen corresponding path program 1 times [2025-03-03 10:49:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096589071] [2025-03-03 10:49:51,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-03 10:49:51,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-03 10:49:51,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:51,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-03 10:49:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:51,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096589071] [2025-03-03 10:49:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096589071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696043233] [2025-03-03 10:49:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:51,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:51,501 INFO L87 Difference]: Start difference. First operand 10869 states and 12330 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:52,707 INFO L93 Difference]: Finished difference Result 26817 states and 30540 transitions. [2025-03-03 10:49:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:52,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 533 [2025-03-03 10:49:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:52,729 INFO L225 Difference]: With dead ends: 26817 [2025-03-03 10:49:52,729 INFO L226 Difference]: Without dead ends: 16249 [2025-03-03 10:49:52,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:52,740 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 281 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:52,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 263 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-03-03 10:49:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 12660. [2025-03-03 10:49:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12660 states, 12659 states have (on average 1.137925586539221) internal successors, (14405), 12659 states have internal predecessors, (14405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 14405 transitions. [2025-03-03 10:49:52,855 INFO L78 Accepts]: Start accepts. Automaton has 12660 states and 14405 transitions. Word has length 533 [2025-03-03 10:49:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:52,856 INFO L471 AbstractCegarLoop]: Abstraction has 12660 states and 14405 transitions. [2025-03-03 10:49:52,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 12660 states and 14405 transitions. [2025-03-03 10:49:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-03-03 10:49:52,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:52,862 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:52,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:49:52,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:52,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2026685306, now seen corresponding path program 1 times [2025-03-03 10:49:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497092964] [2025-03-03 10:49:52,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:52,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-03-03 10:49:52,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-03-03 10:49:52,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-03 10:49:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497092964] [2025-03-03 10:49:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497092964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424184249] [2025-03-03 10:49:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:53,072 INFO L87 Difference]: Start difference. First operand 12660 states and 14405 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:53,929 INFO L93 Difference]: Finished difference Result 25316 states and 28842 transitions. [2025-03-03 10:49:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 560 [2025-03-03 10:49:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:53,942 INFO L225 Difference]: With dead ends: 25316 [2025-03-03 10:49:53,942 INFO L226 Difference]: Without dead ends: 12957 [2025-03-03 10:49:53,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:53,948 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:53,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:49:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12957 states. [2025-03-03 10:49:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12957 to 12658. [2025-03-03 10:49:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12658 states, 12657 states have (on average 1.13778936556846) internal successors, (14401), 12657 states have internal predecessors, (14401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12658 states to 12658 states and 14401 transitions. [2025-03-03 10:49:54,048 INFO L78 Accepts]: Start accepts. Automaton has 12658 states and 14401 transitions. Word has length 560 [2025-03-03 10:49:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:54,049 INFO L471 AbstractCegarLoop]: Abstraction has 12658 states and 14401 transitions. [2025-03-03 10:49:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12658 states and 14401 transitions. [2025-03-03 10:49:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-03 10:49:54,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:54,055 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:54,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:49:54,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:54,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1061443785, now seen corresponding path program 1 times [2025-03-03 10:49:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426334571] [2025-03-03 10:49:54,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:54,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-03 10:49:54,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-03 10:49:54,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:54,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-03 10:49:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426334571] [2025-03-03 10:49:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426334571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:54,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:54,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635554389] [2025-03-03 10:49:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:54,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:54,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:54,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:54,249 INFO L87 Difference]: Start difference. First operand 12658 states and 14401 transitions. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:55,048 INFO L93 Difference]: Finished difference Result 26807 states and 30515 transitions. [2025-03-03 10:49:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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 580 [2025-03-03 10:49:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:55,063 INFO L225 Difference]: With dead ends: 26807 [2025-03-03 10:49:55,063 INFO L226 Difference]: Without dead ends: 14450 [2025-03-03 10:49:55,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:55,075 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:55,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:49:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2025-03-03 10:49:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 10560. [2025-03-03 10:49:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10560 states, 10559 states have (on average 1.1485936168197746) internal successors, (12128), 10559 states have internal predecessors, (12128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 12128 transitions. [2025-03-03 10:49:55,166 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 12128 transitions. Word has length 580 [2025-03-03 10:49:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:55,167 INFO L471 AbstractCegarLoop]: Abstraction has 10560 states and 12128 transitions. [2025-03-03 10:49:55,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 12128 transitions. [2025-03-03 10:49:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-03 10:49:55,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:55,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:55,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:49:55,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:55,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1495219762, now seen corresponding path program 1 times [2025-03-03 10:49:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:55,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238084657] [2025-03-03 10:49:55,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:55,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 10:49:55,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 10:49:55,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:55,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238084657] [2025-03-03 10:49:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238084657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633757315] [2025-03-03 10:49:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:55,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:55,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:55,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:55,584 INFO L87 Difference]: Start difference. First operand 10560 states and 12128 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:56,601 INFO L93 Difference]: Finished difference Result 26799 states and 30880 transitions. [2025-03-03 10:49:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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 586 [2025-03-03 10:49:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:56,617 INFO L225 Difference]: With dead ends: 26799 [2025-03-03 10:49:56,617 INFO L226 Difference]: Without dead ends: 16540 [2025-03-03 10:49:56,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:56,625 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 221 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:56,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 204 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16540 states. [2025-03-03 10:49:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16540 to 12952. [2025-03-03 10:49:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12952 states, 12951 states have (on average 1.1646977067407922) internal successors, (15084), 12951 states have internal predecessors, (15084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 15084 transitions. [2025-03-03 10:49:56,755 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 15084 transitions. Word has length 586 [2025-03-03 10:49:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:56,756 INFO L471 AbstractCegarLoop]: Abstraction has 12952 states and 15084 transitions. [2025-03-03 10:49:56,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 15084 transitions. [2025-03-03 10:49:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-03 10:49:56,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:56,761 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:56,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:49:56,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:56,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:56,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1745023367, now seen corresponding path program 1 times [2025-03-03 10:49:56,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:56,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2386021] [2025-03-03 10:49:56,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:56,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-03 10:49:56,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-03 10:49:56,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:56,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 10:49:56,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:56,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2386021] [2025-03-03 10:49:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2386021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299256511] [2025-03-03 10:49:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:56,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:56,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:56,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:56,930 INFO L87 Difference]: Start difference. First operand 12952 states and 15084 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:57,932 INFO L93 Difference]: Finished difference Result 28592 states and 33860 transitions. [2025-03-03 10:49:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 606 [2025-03-03 10:49:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:57,948 INFO L225 Difference]: With dead ends: 28592 [2025-03-03 10:49:57,948 INFO L226 Difference]: Without dead ends: 15941 [2025-03-03 10:49:57,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:57,958 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 355 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:57,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 444 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:49:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15941 states. [2025-03-03 10:49:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15941 to 15941. [2025-03-03 10:49:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15941 states, 15940 states have (on average 1.1622961104140528) internal successors, (18527), 15940 states have internal predecessors, (18527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15941 states to 15941 states and 18527 transitions. [2025-03-03 10:49:58,188 INFO L78 Accepts]: Start accepts. Automaton has 15941 states and 18527 transitions. Word has length 606 [2025-03-03 10:49:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:58,188 INFO L471 AbstractCegarLoop]: Abstraction has 15941 states and 18527 transitions. [2025-03-03 10:49:58,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15941 states and 18527 transitions. [2025-03-03 10:49:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 10:49:58,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:58,197 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:58,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:49:58,197 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash -896549639, now seen corresponding path program 1 times [2025-03-03 10:49:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943767320] [2025-03-03 10:49:58,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:58,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 10:49:58,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 10:49:58,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:58,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 680 proven. 39 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-03 10:49:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943767320] [2025-03-03 10:49:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943767320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852074902] [2025-03-03 10:49:58,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:58,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:58,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:49:58,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 10:49:58,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 10:49:58,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:58,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:58,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:58,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-03-03 10:49:58,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852074902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:58,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:49:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214580507] [2025-03-03 10:49:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:58,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:58,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:49:58,881 INFO L87 Difference]: Start difference. First operand 15941 states and 18527 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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-03 10:50:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:00,140 INFO L93 Difference]: Finished difference Result 33973 states and 39710 transitions. [2025-03-03 10:50:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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 622 [2025-03-03 10:50:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:00,158 INFO L225 Difference]: With dead ends: 33973 [2025-03-03 10:50:00,158 INFO L226 Difference]: Without dead ends: 18333 [2025-03-03 10:50:00,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:50:00,170 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 262 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:00,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 630 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:50:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2025-03-03 10:50:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 18033. [2025-03-03 10:50:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18033 states, 18032 states have (on average 1.1256100266193434) internal successors, (20297), 18032 states have internal predecessors, (20297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18033 states to 18033 states and 20297 transitions. [2025-03-03 10:50:00,406 INFO L78 Accepts]: Start accepts. Automaton has 18033 states and 20297 transitions. Word has length 622 [2025-03-03 10:50:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:00,407 INFO L471 AbstractCegarLoop]: Abstraction has 18033 states and 20297 transitions. [2025-03-03 10:50:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 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-03 10:50:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18033 states and 20297 transitions. [2025-03-03 10:50:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-03 10:50:00,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:00,421 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:00,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:50:00,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:50:00,622 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1813275895, now seen corresponding path program 1 times [2025-03-03 10:50:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625245984] [2025-03-03 10:50:00,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:00,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 10:50:00,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 10:50:00,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:00,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 753 proven. 39 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-03-03 10:50:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625245984] [2025-03-03 10:50:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625245984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421157169] [2025-03-03 10:50:01,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:01,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:01,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:01,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:50:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-03 10:50:01,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-03 10:50:01,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:01,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:01,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:50:01,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 753 proven. 39 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-03-03 10:50:01,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:50:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 753 proven. 39 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-03-03 10:50:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421157169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:50:02,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:50:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:50:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042123322] [2025-03-03 10:50:02,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:50:02,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:50:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:02,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:50:02,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:50:02,478 INFO L87 Difference]: Start difference. First operand 18033 states and 20297 transitions. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 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-03 10:50:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:07,369 INFO L93 Difference]: Finished difference Result 43994 states and 49154 transitions. [2025-03-03 10:50:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:50:07,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 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) Word has length 680 [2025-03-03 10:50:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:07,388 INFO L225 Difference]: With dead ends: 43994 [2025-03-03 10:50:07,388 INFO L226 Difference]: Without dead ends: 18930 [2025-03-03 10:50:07,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1369 GetRequests, 1355 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:50:07,403 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2431 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 7805 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 8328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 7805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:07,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 348 Invalid, 8328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 7805 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 10:50:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18930 states. [2025-03-03 10:50:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18930 to 15340. [2025-03-03 10:50:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15340 states, 15339 states have (on average 1.0541756307451593) internal successors, (16170), 15339 states have internal predecessors, (16170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15340 states to 15340 states and 16170 transitions. [2025-03-03 10:50:07,542 INFO L78 Accepts]: Start accepts. Automaton has 15340 states and 16170 transitions. Word has length 680 [2025-03-03 10:50:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:07,542 INFO L471 AbstractCegarLoop]: Abstraction has 15340 states and 16170 transitions. [2025-03-03 10:50:07,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 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-03 10:50:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15340 states and 16170 transitions. [2025-03-03 10:50:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 10:50:07,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:07,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:07,557 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-03 10:50:07,749 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,SelfDestructingSolverStorable16 [2025-03-03 10:50:07,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:07,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1291075144, now seen corresponding path program 1 times [2025-03-03 10:50:07,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:07,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639968864] [2025-03-03 10:50:07,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 10:50:07,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 10:50:07,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:07,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-03-03 10:50:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639968864] [2025-03-03 10:50:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639968864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282199053] [2025-03-03 10:50:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:08,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:08,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:08,089 INFO L87 Difference]: Start difference. First operand 15340 states and 16170 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:08,737 INFO L93 Difference]: Finished difference Result 30985 states and 32647 transitions. [2025-03-03 10:50:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 688 [2025-03-03 10:50:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:08,750 INFO L225 Difference]: With dead ends: 30985 [2025-03-03 10:50:08,750 INFO L226 Difference]: Without dead ends: 15647 [2025-03-03 10:50:08,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:08,758 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 264 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:08,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 516 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15647 states. [2025-03-03 10:50:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15647 to 14741. [2025-03-03 10:50:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14741 states, 14740 states have (on average 1.0523744911804613) internal successors, (15512), 14740 states have internal predecessors, (15512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14741 states to 14741 states and 15512 transitions. [2025-03-03 10:50:08,860 INFO L78 Accepts]: Start accepts. Automaton has 14741 states and 15512 transitions. Word has length 688 [2025-03-03 10:50:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:08,860 INFO L471 AbstractCegarLoop]: Abstraction has 14741 states and 15512 transitions. [2025-03-03 10:50:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14741 states and 15512 transitions. [2025-03-03 10:50:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-03-03 10:50:08,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:08,868 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:08,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:50:08,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -470126684, now seen corresponding path program 1 times [2025-03-03 10:50:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680304793] [2025-03-03 10:50:08,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:08,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-03-03 10:50:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-03-03 10:50:08,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:08,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 571 proven. 188 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-03 10:50:09,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680304793] [2025-03-03 10:50:09,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680304793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990220990] [2025-03-03 10:50:09,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:09,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:09,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:09,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:50:09,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-03-03 10:50:09,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-03-03 10:50:09,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:09,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:09,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:50:09,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-03 10:50:10,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:10,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990220990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:10,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:10,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-03 10:50:10,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129100848] [2025-03-03 10:50:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:10,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:10,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:10,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:50:10,180 INFO L87 Difference]: Start difference. First operand 14741 states and 15512 transitions. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:11,306 INFO L93 Difference]: Finished difference Result 36079 states and 37889 transitions. [2025-03-03 10:50:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:11,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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 750 [2025-03-03 10:50:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:11,327 INFO L225 Difference]: With dead ends: 36079 [2025-03-03 10:50:11,327 INFO L226 Difference]: Without dead ends: 21639 [2025-03-03 10:50:11,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:50:11,337 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 491 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:11,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 142 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:50:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21639 states. [2025-03-03 10:50:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21639 to 19839. [2025-03-03 10:50:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19839 states, 19838 states have (on average 1.0474846254662769) internal successors, (20780), 19838 states have internal predecessors, (20780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19839 states to 19839 states and 20780 transitions. [2025-03-03 10:50:11,506 INFO L78 Accepts]: Start accepts. Automaton has 19839 states and 20780 transitions. Word has length 750 [2025-03-03 10:50:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 19839 states and 20780 transitions. [2025-03-03 10:50:11,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19839 states and 20780 transitions. [2025-03-03 10:50:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 10:50:11,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:11,518 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:11,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:50:11,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:11,719 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -95842380, now seen corresponding path program 1 times [2025-03-03 10:50:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616159346] [2025-03-03 10:50:11,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:11,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 10:50:11,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 10:50:11,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:11,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 686 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-03 10:50:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616159346] [2025-03-03 10:50:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616159346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658366583] [2025-03-03 10:50:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:12,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:12,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:12,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:12,516 INFO L87 Difference]: Start difference. First operand 19839 states and 20780 transitions. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:13,485 INFO L93 Difference]: Finished difference Result 40024 states and 41930 transitions. [2025-03-03 10:50:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:50:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 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 791 [2025-03-03 10:50:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:13,503 INFO L225 Difference]: With dead ends: 40024 [2025-03-03 10:50:13,503 INFO L226 Difference]: Without dead ends: 20486 [2025-03-03 10:50:13,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:13,514 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:13,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 524 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:50:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2025-03-03 10:50:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20437. [2025-03-03 10:50:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20437 states, 20436 states have (on average 1.046486592288119) internal successors, (21386), 20436 states have internal predecessors, (21386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20437 states to 20437 states and 21386 transitions. [2025-03-03 10:50:13,698 INFO L78 Accepts]: Start accepts. Automaton has 20437 states and 21386 transitions. Word has length 791 [2025-03-03 10:50:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:13,699 INFO L471 AbstractCegarLoop]: Abstraction has 20437 states and 21386 transitions. [2025-03-03 10:50:13,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 20437 states and 21386 transitions. [2025-03-03 10:50:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-03-03 10:50:13,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:13,708 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:13,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:50:13,708 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1184234362, now seen corresponding path program 1 times [2025-03-03 10:50:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188158297] [2025-03-03 10:50:13,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-03-03 10:50:13,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-03-03 10:50:13,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:13,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 10:50:14,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188158297] [2025-03-03 10:50:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188158297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:14,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146073133] [2025-03-03 10:50:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:14,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:14,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:14,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:14,299 INFO L87 Difference]: Start difference. First operand 20437 states and 21386 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:15,538 INFO L93 Difference]: Finished difference Result 49292 states and 51697 transitions. [2025-03-03 10:50:15,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:15,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 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 797 [2025-03-03 10:50:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:15,569 INFO L225 Difference]: With dead ends: 49292 [2025-03-03 10:50:15,569 INFO L226 Difference]: Without dead ends: 28857 [2025-03-03 10:50:15,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:15,586 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 436 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:15,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 132 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:50:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28857 states. [2025-03-03 10:50:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28857 to 23436. [2025-03-03 10:50:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23436 states, 23435 states have (on average 1.0499679965863025) internal successors, (24606), 23435 states have internal predecessors, (24606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23436 states to 23436 states and 24606 transitions. [2025-03-03 10:50:15,770 INFO L78 Accepts]: Start accepts. Automaton has 23436 states and 24606 transitions. Word has length 797 [2025-03-03 10:50:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:15,771 INFO L471 AbstractCegarLoop]: Abstraction has 23436 states and 24606 transitions. [2025-03-03 10:50:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 23436 states and 24606 transitions. [2025-03-03 10:50:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-03 10:50:15,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:15,782 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:15,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:50:15,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:15,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash 93583075, now seen corresponding path program 1 times [2025-03-03 10:50:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:15,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377943118] [2025-03-03 10:50:15,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:15,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-03 10:50:15,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-03 10:50:15,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-03 10:50:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:16,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377943118] [2025-03-03 10:50:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377943118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978829329] [2025-03-03 10:50:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:16,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:16,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:16,095 INFO L87 Difference]: Start difference. First operand 23436 states and 24606 transitions. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:17,068 INFO L93 Difference]: Finished difference Result 52257 states and 54813 transitions. [2025-03-03 10:50:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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 829 [2025-03-03 10:50:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:17,093 INFO L225 Difference]: With dead ends: 52257 [2025-03-03 10:50:17,093 INFO L226 Difference]: Without dead ends: 29122 [2025-03-03 10:50:17,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:17,108 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 524 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:17,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 171 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:50:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29122 states. [2025-03-03 10:50:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29122 to 23436. [2025-03-03 10:50:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23436 states, 23435 states have (on average 1.0499679965863025) internal successors, (24606), 23435 states have internal predecessors, (24606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23436 states to 23436 states and 24606 transitions. [2025-03-03 10:50:17,295 INFO L78 Accepts]: Start accepts. Automaton has 23436 states and 24606 transitions. Word has length 829 [2025-03-03 10:50:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:17,295 INFO L471 AbstractCegarLoop]: Abstraction has 23436 states and 24606 transitions. [2025-03-03 10:50:17,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 23436 states and 24606 transitions. [2025-03-03 10:50:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2025-03-03 10:50:17,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:17,308 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:50:17,308 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1654737537, now seen corresponding path program 1 times [2025-03-03 10:50:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131218145] [2025-03-03 10:50:17,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:17,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 894 statements into 1 equivalence classes. [2025-03-03 10:50:17,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 894 of 894 statements. [2025-03-03 10:50:17,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:17,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 10:50:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131218145] [2025-03-03 10:50:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131218145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199638490] [2025-03-03 10:50:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:17,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:17,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:17,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:17,643 INFO L87 Difference]: Start difference. First operand 23436 states and 24606 transitions. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:18,628 INFO L93 Difference]: Finished difference Result 52555 states and 55119 transitions. [2025-03-03 10:50:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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 894 [2025-03-03 10:50:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:18,655 INFO L225 Difference]: With dead ends: 52555 [2025-03-03 10:50:18,655 INFO L226 Difference]: Without dead ends: 29420 [2025-03-03 10:50:18,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:18,670 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 688 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 150 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29420 states. [2025-03-03 10:50:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29420 to 23435. [2025-03-03 10:50:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23435 states, 23434 states have (on average 1.0494580524024921) internal successors, (24593), 23434 states have internal predecessors, (24593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23435 states to 23435 states and 24593 transitions. [2025-03-03 10:50:18,866 INFO L78 Accepts]: Start accepts. Automaton has 23435 states and 24593 transitions. Word has length 894 [2025-03-03 10:50:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 23435 states and 24593 transitions. [2025-03-03 10:50:18,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23435 states and 24593 transitions. [2025-03-03 10:50:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-03-03 10:50:18,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:18,880 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:50:18,880 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 157244635, now seen corresponding path program 1 times [2025-03-03 10:50:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037451448] [2025-03-03 10:50:18,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:18,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-03-03 10:50:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-03-03 10:50:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1597 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-03 10:50:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:19,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037451448] [2025-03-03 10:50:19,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037451448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:19,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:50:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243835838] [2025-03-03 10:50:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:19,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:50:19,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:19,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:50:19,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:19,617 INFO L87 Difference]: Start difference. First operand 23435 states and 24593 transitions. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:20,514 INFO L93 Difference]: Finished difference Result 46266 states and 48549 transitions. [2025-03-03 10:50:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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 909 [2025-03-03 10:50:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:20,537 INFO L225 Difference]: With dead ends: 46266 [2025-03-03 10:50:20,537 INFO L226 Difference]: Without dead ends: 23132 [2025-03-03 10:50:20,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:20,553 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 320 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:20,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 558 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23132 states. [2025-03-03 10:50:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23132 to 22534. [2025-03-03 10:50:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.0314205831447212) internal successors, (23241), 22533 states have internal predecessors, (23241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 23241 transitions. [2025-03-03 10:50:20,783 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 23241 transitions. Word has length 909 [2025-03-03 10:50:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:20,783 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 23241 transitions. [2025-03-03 10:50:20,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 23241 transitions. [2025-03-03 10:50:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2025-03-03 10:50:20,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:20,797 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:50:20,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:50:20,797 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:20,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1868010099, now seen corresponding path program 1 times [2025-03-03 10:50:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020945374] [2025-03-03 10:50:20,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:20,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 945 statements into 1 equivalence classes. [2025-03-03 10:50:20,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 945 of 945 statements. [2025-03-03 10:50:20,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:20,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1611 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2025-03-03 10:50:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020945374] [2025-03-03 10:50:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020945374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871839201] [2025-03-03 10:50:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:21,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:21,198 INFO L87 Difference]: Start difference. First operand 22534 states and 23241 transitions. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:22,179 INFO L93 Difference]: Finished difference Result 49558 states and 51072 transitions. [2025-03-03 10:50:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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 945 [2025-03-03 10:50:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:22,201 INFO L225 Difference]: With dead ends: 49558 [2025-03-03 10:50:22,201 INFO L226 Difference]: Without dead ends: 26723 [2025-03-03 10:50:22,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:22,208 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 593 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:22,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 134 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26723 states. [2025-03-03 10:50:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26723 to 22530. [2025-03-03 10:50:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22530 states, 22529 states have (on average 1.03062719161969) internal successors, (23219), 22529 states have internal predecessors, (23219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22530 states to 22530 states and 23219 transitions. [2025-03-03 10:50:22,382 INFO L78 Accepts]: Start accepts. Automaton has 22530 states and 23219 transitions. Word has length 945 [2025-03-03 10:50:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:22,382 INFO L471 AbstractCegarLoop]: Abstraction has 22530 states and 23219 transitions. [2025-03-03 10:50:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22530 states and 23219 transitions. [2025-03-03 10:50:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-03-03 10:50:22,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:22,396 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:22,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 10:50:22,397 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:22,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash -144716746, now seen corresponding path program 1 times [2025-03-03 10:50:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097472095] [2025-03-03 10:50:22,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:22,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-03-03 10:50:22,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-03-03 10:50:22,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:22,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 1053 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-03-03 10:50:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097472095] [2025-03-03 10:50:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097472095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:23,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107984524] [2025-03-03 10:50:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:23,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:23,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:23,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:23,173 INFO L87 Difference]: Start difference. First operand 22530 states and 23219 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:24,251 INFO L93 Difference]: Finished difference Result 27927 states and 28761 transitions. [2025-03-03 10:50:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:24,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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 967 [2025-03-03 10:50:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:24,278 INFO L225 Difference]: With dead ends: 27927 [2025-03-03 10:50:24,278 INFO L226 Difference]: Without dead ends: 27925 [2025-03-03 10:50:24,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:24,285 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 486 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:24,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 136 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:50:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27925 states. [2025-03-03 10:50:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27925 to 19835. [2025-03-03 10:50:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19835 states, 19834 states have (on average 1.032368659876979) internal successors, (20476), 19834 states have internal predecessors, (20476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19835 states to 19835 states and 20476 transitions. [2025-03-03 10:50:24,533 INFO L78 Accepts]: Start accepts. Automaton has 19835 states and 20476 transitions. Word has length 967 [2025-03-03 10:50:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:24,534 INFO L471 AbstractCegarLoop]: Abstraction has 19835 states and 20476 transitions. [2025-03-03 10:50:24,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19835 states and 20476 transitions. [2025-03-03 10:50:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2025-03-03 10:50:24,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:24,555 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:24,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:50:24,556 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:24,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash -57968983, now seen corresponding path program 1 times [2025-03-03 10:50:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661506127] [2025-03-03 10:50:24,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:24,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes. [2025-03-03 10:50:24,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 986 of 986 statements. [2025-03-03 10:50:24,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:24,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1030 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2025-03-03 10:50:25,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661506127] [2025-03-03 10:50:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661506127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:25,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:50:25,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458612781] [2025-03-03 10:50:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:50:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:25,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:50:25,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:25,337 INFO L87 Difference]: Start difference. First operand 19835 states and 20476 transitions. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:26,626 INFO L93 Difference]: Finished difference Result 28832 states and 29769 transitions. [2025-03-03 10:50:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:50:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 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 986 [2025-03-03 10:50:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:26,651 INFO L225 Difference]: With dead ends: 28832 [2025-03-03 10:50:26,651 INFO L226 Difference]: Without dead ends: 28830 [2025-03-03 10:50:26,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:26,659 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 781 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:26,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 189 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:50:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2025-03-03 10:50:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 19533. [2025-03-03 10:50:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19533 states, 19532 states have (on average 1.0325619496211345) internal successors, (20168), 19532 states have internal predecessors, (20168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 20168 transitions. [2025-03-03 10:50:26,824 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 20168 transitions. Word has length 986 [2025-03-03 10:50:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 19533 states and 20168 transitions. [2025-03-03 10:50:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 20168 transitions. [2025-03-03 10:50:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1003 [2025-03-03 10:50:26,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:26,836 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:26,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 10:50:26,836 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1727656245, now seen corresponding path program 1 times [2025-03-03 10:50:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970073087] [2025-03-03 10:50:26,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:26,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1002 statements into 1 equivalence classes. [2025-03-03 10:50:26,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1002 of 1002 statements. [2025-03-03 10:50:26,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:26,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 1274 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 10:50:27,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970073087] [2025-03-03 10:50:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970073087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:27,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:27,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:27,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330104805] [2025-03-03 10:50:27,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:27,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:27,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:27,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:27,301 INFO L87 Difference]: Start difference. First operand 19533 states and 20168 transitions. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:27,954 INFO L93 Difference]: Finished difference Result 42054 states and 43460 transitions. [2025-03-03 10:50:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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 1002 [2025-03-03 10:50:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:27,972 INFO L225 Difference]: With dead ends: 42054 [2025-03-03 10:50:27,973 INFO L226 Difference]: Without dead ends: 22822 [2025-03-03 10:50:27,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:27,983 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 220 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:27,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 451 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22822 states. [2025-03-03 10:50:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22822 to 21923. [2025-03-03 10:50:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21923 states, 21922 states have (on average 1.0269592190493568) internal successors, (22513), 21922 states have internal predecessors, (22513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21923 states to 21923 states and 22513 transitions. [2025-03-03 10:50:28,156 INFO L78 Accepts]: Start accepts. Automaton has 21923 states and 22513 transitions. Word has length 1002 [2025-03-03 10:50:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:28,156 INFO L471 AbstractCegarLoop]: Abstraction has 21923 states and 22513 transitions. [2025-03-03 10:50:28,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 21923 states and 22513 transitions. [2025-03-03 10:50:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2025-03-03 10:50:28,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:28,169 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:28,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 10:50:28,170 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:28,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2010401428, now seen corresponding path program 1 times [2025-03-03 10:50:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635862399] [2025-03-03 10:50:28,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:28,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1042 statements into 1 equivalence classes. [2025-03-03 10:50:28,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1042 of 1042 statements. [2025-03-03 10:50:28,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:28,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1698 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2025-03-03 10:50:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635862399] [2025-03-03 10:50:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635862399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:28,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113419775] [2025-03-03 10:50:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:28,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:28,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:28,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:28,926 INFO L87 Difference]: Start difference. First operand 21923 states and 22513 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:29,587 INFO L93 Difference]: Finished difference Result 45647 states and 46876 transitions. [2025-03-03 10:50:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1042 [2025-03-03 10:50:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:29,609 INFO L225 Difference]: With dead ends: 45647 [2025-03-03 10:50:29,609 INFO L226 Difference]: Without dead ends: 24025 [2025-03-03 10:50:29,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:29,623 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 347 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:29,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 113 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24025 states. [2025-03-03 10:50:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24025 to 21622. [2025-03-03 10:50:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21622 states, 21621 states have (on average 1.0257157393275056) internal successors, (22177), 21621 states have internal predecessors, (22177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21622 states to 21622 states and 22177 transitions. [2025-03-03 10:50:29,796 INFO L78 Accepts]: Start accepts. Automaton has 21622 states and 22177 transitions. Word has length 1042 [2025-03-03 10:50:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:29,797 INFO L471 AbstractCegarLoop]: Abstraction has 21622 states and 22177 transitions. [2025-03-03 10:50:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21622 states and 22177 transitions. [2025-03-03 10:50:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2025-03-03 10:50:29,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:29,846 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:29,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 10:50:29,846 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 158453131, now seen corresponding path program 1 times [2025-03-03 10:50:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967078179] [2025-03-03 10:50:29,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:29,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1055 statements into 1 equivalence classes. [2025-03-03 10:50:29,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1055 of 1055 statements. [2025-03-03 10:50:29,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-03-03 10:50:30,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:30,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967078179] [2025-03-03 10:50:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967078179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:30,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:30,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343939735] [2025-03-03 10:50:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:30,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:30,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:30,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:30,326 INFO L87 Difference]: Start difference. First operand 21622 states and 22177 transitions. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:30,949 INFO L93 Difference]: Finished difference Result 46250 states and 47432 transitions. [2025-03-03 10:50:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 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 1055 [2025-03-03 10:50:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:30,974 INFO L225 Difference]: With dead ends: 46250 [2025-03-03 10:50:30,974 INFO L226 Difference]: Without dead ends: 24929 [2025-03-03 10:50:30,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:30,988 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 37 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:30,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 507 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24929 states. [2025-03-03 10:50:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24929 to 24030. [2025-03-03 10:50:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24030 states, 24029 states have (on average 1.0226809272129511) internal successors, (24574), 24029 states have internal predecessors, (24574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24030 states to 24030 states and 24574 transitions. [2025-03-03 10:50:31,288 INFO L78 Accepts]: Start accepts. Automaton has 24030 states and 24574 transitions. Word has length 1055 [2025-03-03 10:50:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:31,288 INFO L471 AbstractCegarLoop]: Abstraction has 24030 states and 24574 transitions. [2025-03-03 10:50:31,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 24030 states and 24574 transitions. [2025-03-03 10:50:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2025-03-03 10:50:31,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:31,305 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 10:50:31,305 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2109000636, now seen corresponding path program 1 times [2025-03-03 10:50:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477754090] [2025-03-03 10:50:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:31,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1129 statements into 1 equivalence classes. [2025-03-03 10:50:31,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1129 of 1129 statements. [2025-03-03 10:50:31,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 1198 proven. 188 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2025-03-03 10:50:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477754090] [2025-03-03 10:50:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477754090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784018416] [2025-03-03 10:50:32,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:32,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:32,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:32,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:50:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1129 statements into 1 equivalence classes. [2025-03-03 10:50:32,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1129 of 1129 statements. [2025-03-03 10:50:32,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:32,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:32,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:50:32,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 955 proven. 0 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-03 10:50:32,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784018416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:32,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:32,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-03 10:50:32,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032474863] [2025-03-03 10:50:32,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:32,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:50:32,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:32,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:50:32,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:50:32,850 INFO L87 Difference]: Start difference. First operand 24030 states and 24574 transitions. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:34,123 INFO L93 Difference]: Finished difference Result 31529 states and 32248 transitions. [2025-03-03 10:50:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:50:34,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 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 1129 [2025-03-03 10:50:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:34,147 INFO L225 Difference]: With dead ends: 31529 [2025-03-03 10:50:34,147 INFO L226 Difference]: Without dead ends: 31527 [2025-03-03 10:50:34,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:50:34,152 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1036 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:34,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 123 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:50:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31527 states. [2025-03-03 10:50:34,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31527 to 23730. [2025-03-03 10:50:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23730 states, 23729 states have (on average 1.0223776813182182) internal successors, (24260), 23729 states have internal predecessors, (24260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23730 states to 23730 states and 24260 transitions. [2025-03-03 10:50:34,411 INFO L78 Accepts]: Start accepts. Automaton has 23730 states and 24260 transitions. Word has length 1129 [2025-03-03 10:50:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:34,412 INFO L471 AbstractCegarLoop]: Abstraction has 23730 states and 24260 transitions. [2025-03-03 10:50:34,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 23730 states and 24260 transitions. [2025-03-03 10:50:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2025-03-03 10:50:34,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:34,438 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:50:34,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:50:34,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:34,638 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:34,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1141805966, now seen corresponding path program 1 times [2025-03-03 10:50:34,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:34,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836694761] [2025-03-03 10:50:34,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:34,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:34,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1137 statements into 1 equivalence classes. [2025-03-03 10:50:34,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1137 of 1137 statements. [2025-03-03 10:50:34,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:34,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 114 proven. 1161 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-03 10:50:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:35,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836694761] [2025-03-03 10:50:35,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836694761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:35,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782886066] [2025-03-03 10:50:35,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:35,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:35,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:35,918 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:35,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:50:36,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1137 statements into 1 equivalence classes. [2025-03-03 10:50:36,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1137 of 1137 statements. [2025-03-03 10:50:36,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:36,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:50:36,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 114 proven. 1161 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-03 10:50:38,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:50:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 114 proven. 1161 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-03 10:50:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782886066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:50:40,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:50:40,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-03 10:50:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781254189] [2025-03-03 10:50:40,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:50:40,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:50:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:40,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:50:40,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:50:40,760 INFO L87 Difference]: Start difference. First operand 23730 states and 24260 transitions. Second operand has 10 states, 10 states have (on average 117.6) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:42,992 INFO L93 Difference]: Finished difference Result 58853 states and 60142 transitions. [2025-03-03 10:50:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 10:50:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 117.6) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 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 1137 [2025-03-03 10:50:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:43,024 INFO L225 Difference]: With dead ends: 58853 [2025-03-03 10:50:43,025 INFO L226 Difference]: Without dead ends: 35424 [2025-03-03 10:50:43,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2283 GetRequests, 2268 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:50:43,039 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2894 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:43,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2894 Valid, 216 Invalid, 3493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 3004 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:50:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35424 states. [2025-03-03 10:50:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35424 to 21330. [2025-03-03 10:50:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21330 states, 21329 states have (on average 1.0224576867176145) internal successors, (21808), 21329 states have internal predecessors, (21808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21330 states to 21330 states and 21808 transitions. [2025-03-03 10:50:43,246 INFO L78 Accepts]: Start accepts. Automaton has 21330 states and 21808 transitions. Word has length 1137 [2025-03-03 10:50:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:43,247 INFO L471 AbstractCegarLoop]: Abstraction has 21330 states and 21808 transitions. [2025-03-03 10:50:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.6) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 21330 states and 21808 transitions. [2025-03-03 10:50:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1171 [2025-03-03 10:50:43,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:43,261 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:43,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:50:43,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:43,462 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash 711175836, now seen corresponding path program 1 times [2025-03-03 10:50:43,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344565762] [2025-03-03 10:50:43,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:43,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1170 statements into 1 equivalence classes. [2025-03-03 10:50:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1170 of 1170 statements. [2025-03-03 10:50:43,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 1512 proven. 187 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2025-03-03 10:50:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344565762] [2025-03-03 10:50:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344565762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457225823] [2025-03-03 10:50:45,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:45,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:45,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:45,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:50:45,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1170 statements into 1 equivalence classes. [2025-03-03 10:50:45,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1170 of 1170 statements. [2025-03-03 10:50:45,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:45,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:45,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:50:45,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 1019 proven. 57 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-03 10:50:45,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:50:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 1019 proven. 57 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-03 10:50:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457225823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:50:45,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:50:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2025-03-03 10:50:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39463250] [2025-03-03 10:50:45,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:50:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 10:50:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:45,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 10:50:45,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:50:45,789 INFO L87 Difference]: Start difference. First operand 21330 states and 21808 transitions. Second operand has 12 states, 12 states have (on average 112.08333333333333) internal successors, (1345), 12 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)