./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label15.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8295e17271be78ac0a7fd91eab40bb43faa05c2eb6916b9e37abf543b4d8bff6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:24:10,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:24:10,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:24:10,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:24:10,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:24:10,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:24:10,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:24:10,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:24:10,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:24:10,959 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:24:10,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:24:10,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:24:10,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:24:10,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:24:10,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:24:10,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:24:10,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:24:10,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:24:10,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:24:10,963 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-jdk21/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 -> 8295e17271be78ac0a7fd91eab40bb43faa05c2eb6916b9e37abf543b4d8bff6 [2025-01-09 00:24:11,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:24:11,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:24:11,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:24:11,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:24:11,202 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:24:11,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label15.c [2025-01-09 00:24:12,412 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20616fd18/facd18e0f84e476e9190a37634b5ac77/FLAG4ca7d3e81 [2025-01-09 00:24:12,938 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:24:12,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label15.c [2025-01-09 00:24:12,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20616fd18/facd18e0f84e476e9190a37634b5ac77/FLAG4ca7d3e81 [2025-01-09 00:24:12,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20616fd18/facd18e0f84e476e9190a37634b5ac77 [2025-01-09 00:24:12,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:24:12,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:24:12,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:24:12,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:24:13,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:24:13,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:24:12" (1/1) ... [2025-01-09 00:24:13,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a5c1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:13, skipping insertion in model container [2025-01-09 00:24:13,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:24:12" (1/1) ... [2025-01-09 00:24:13,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:24:13,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label15.c[7551,7564] [2025-01-09 00:24:14,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:24:14,066 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:24:14,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label15.c[7551,7564] [2025-01-09 00:24:14,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:24:14,565 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:24:14,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14 WrapperNode [2025-01-09 00:24:14,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:24:14,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:24:14,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:24:14,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:24:14,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:14,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,297 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:24:15,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:24:15,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:24:15,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:24:15,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:24:15,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,769 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-01-09 00:24:15,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:15,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:16,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:16,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:16,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:24:16,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:24:16,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:24:16,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:24:16,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (1/1) ... [2025-01-09 00:24:16,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:24:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:24:16,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:24:16,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:24:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:24:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:24:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:24:16,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:24:16,274 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:24:16,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:24:21,794 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:24:21,794 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:24:21,830 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:24:21,830 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:24:21,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:24:21 BoogieIcfgContainer [2025-01-09 00:24:21,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:24:21,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:24:21,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:24:21,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:24:21,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:24:12" (1/3) ... [2025-01-09 00:24:21,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eec588f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:24:21, skipping insertion in model container [2025-01-09 00:24:21,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:14" (2/3) ... [2025-01-09 00:24:21,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eec588f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:24:21, skipping insertion in model container [2025-01-09 00:24:21,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:24:21" (3/3) ... [2025-01-09 00:24:21,845 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label15.c [2025-01-09 00:24:21,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:24:21,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label15.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:24:21,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:24:22,005 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;@4bffb318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:24:22,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:24:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 00:24:22,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:22,032 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] [2025-01-09 00:24:22,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:22,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash -747821350, now seen corresponding path program 1 times [2025-01-09 00:24:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353802600] [2025-01-09 00:24:22,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:22,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 00:24:22,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 00:24:22,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:22,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353802600] [2025-01-09 00:24:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353802600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:22,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929694205] [2025-01-09 00:24:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:22,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:22,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:22,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:22,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:22,551 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:33,042 INFO L93 Difference]: Finished difference Result 6284 states and 12035 transitions. [2025-01-09 00:24:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:33,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-09 00:24:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:33,072 INFO L225 Difference]: With dead ends: 6284 [2025-01-09 00:24:33,072 INFO L226 Difference]: Without dead ends: 4467 [2025-01-09 00:24:33,078 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-01-09 00:24:33,080 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 4225 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10828 mSolverCounterSat, 2355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 13183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 10828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:33,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 2096 Invalid, 13183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2355 Valid, 10828 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 00:24:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2025-01-09 00:24:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4465. [2025-01-09 00:24:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4464 states have (on average 1.564516129032258) internal successors, (6984), 4464 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6984 transitions. [2025-01-09 00:24:33,284 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6984 transitions. Word has length 58 [2025-01-09 00:24:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:33,285 INFO L471 AbstractCegarLoop]: Abstraction has 4465 states and 6984 transitions. [2025-01-09 00:24:33,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6984 transitions. [2025-01-09 00:24:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 00:24:33,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:33,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:24:33,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:24:33,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:33,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1850675636, now seen corresponding path program 1 times [2025-01-09 00:24:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:33,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235026644] [2025-01-09 00:24:33,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:33,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 00:24:33,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 00:24:33,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:33,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235026644] [2025-01-09 00:24:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235026644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121444064] [2025-01-09 00:24:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:34,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:34,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:34,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:34,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:34,290 INFO L87 Difference]: Start difference. First operand 4465 states and 6984 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:42,978 INFO L93 Difference]: Finished difference Result 11706 states and 20175 transitions. [2025-01-09 00:24:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:42,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-01-09 00:24:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:43,036 INFO L225 Difference]: With dead ends: 11706 [2025-01-09 00:24:43,036 INFO L226 Difference]: Without dead ends: 8608 [2025-01-09 00:24:43,044 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-01-09 00:24:43,045 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 1337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 10792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1337 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:43,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 10792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1337 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-01-09 00:24:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2025-01-09 00:24:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 8594. [2025-01-09 00:24:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3480740137321074) internal successors, (11584), 8593 states have internal predecessors, (11584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11584 transitions. [2025-01-09 00:24:43,207 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11584 transitions. Word has length 265 [2025-01-09 00:24:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:43,208 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11584 transitions. [2025-01-09 00:24:43,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11584 transitions. [2025-01-09 00:24:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 00:24:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:43,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:24:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:24:43,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:43,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash 460081870, now seen corresponding path program 1 times [2025-01-09 00:24:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606913559] [2025-01-09 00:24:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:43,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 00:24:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 00:24:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606913559] [2025-01-09 00:24:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606913559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136108271] [2025-01-09 00:24:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:44,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:44,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:44,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:44,066 INFO L87 Difference]: Start difference. First operand 8594 states and 11584 transitions. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:48,399 INFO L93 Difference]: Finished difference Result 14487 states and 20449 transitions. [2025-01-09 00:24:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:48,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 293 [2025-01-09 00:24:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:48,422 INFO L225 Difference]: With dead ends: 14487 [2025-01-09 00:24:48,422 INFO L226 Difference]: Without dead ends: 8594 [2025-01-09 00:24:48,435 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-01-09 00:24:48,440 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5715 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 5723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:48,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1954 Invalid, 5723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5715 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 00:24:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2025-01-09 00:24:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8594. [2025-01-09 00:24:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3465611544280227) internal successors, (11571), 8593 states have internal predecessors, (11571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11571 transitions. [2025-01-09 00:24:48,548 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11571 transitions. Word has length 293 [2025-01-09 00:24:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:48,548 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11571 transitions. [2025-01-09 00:24:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11571 transitions. [2025-01-09 00:24:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-01-09 00:24:48,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:48,555 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:24:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:24:48,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:48,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:48,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1224356008, now seen corresponding path program 1 times [2025-01-09 00:24:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:48,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055497232] [2025-01-09 00:24:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:48,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-01-09 00:24:48,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-01-09 00:24:48,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:48,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:24:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055497232] [2025-01-09 00:24:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055497232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:49,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:49,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:49,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737975288] [2025-01-09 00:24:49,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:49,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:49,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:49,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:49,050 INFO L87 Difference]: Start difference. First operand 8594 states and 11571 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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-01-09 00:24:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:53,998 INFO L93 Difference]: Finished difference Result 20123 states and 28981 transitions. [2025-01-09 00:24:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:54,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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 614 [2025-01-09 00:24:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:54,041 INFO L225 Difference]: With dead ends: 20123 [2025-01-09 00:24:54,042 INFO L226 Difference]: Without dead ends: 14261 [2025-01-09 00:24:54,048 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-01-09 00:24:54,049 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 1356 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:54,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1607 Invalid, 5626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 00:24:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2025-01-09 00:24:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 14244. [2025-01-09 00:24:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14244 states, 14243 states have (on average 1.2722038896299936) internal successors, (18120), 14243 states have internal predecessors, (18120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14244 states to 14244 states and 18120 transitions. [2025-01-09 00:24:54,236 INFO L78 Accepts]: Start accepts. Automaton has 14244 states and 18120 transitions. Word has length 614 [2025-01-09 00:24:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 14244 states and 18120 transitions. [2025-01-09 00:24:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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-01-09 00:24:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14244 states and 18120 transitions. [2025-01-09 00:24:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-01-09 00:24:54,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:54,248 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:24:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:24:54,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:54,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1081636244, now seen corresponding path program 1 times [2025-01-09 00:24:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966346367] [2025-01-09 00:24:54,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:54,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-01-09 00:24:54,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-01-09 00:24:54,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:54,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 00:24:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966346367] [2025-01-09 00:24:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966346367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692585697] [2025-01-09 00:24:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:54,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:54,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:54,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:54,660 INFO L87 Difference]: Start difference. First operand 14244 states and 18120 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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-01-09 00:24:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:59,630 INFO L93 Difference]: Finished difference Result 28511 states and 37629 transitions. [2025-01-09 00:24:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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 619 [2025-01-09 00:24:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:59,661 INFO L225 Difference]: With dead ends: 28511 [2025-01-09 00:24:59,661 INFO L226 Difference]: Without dead ends: 16999 [2025-01-09 00:24:59,670 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-01-09 00:24:59,672 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1387 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 6050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:59,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 756 Invalid, 6050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 00:24:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16999 states. [2025-01-09 00:24:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16999 to 16985. [2025-01-09 00:24:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16985 states, 16984 states have (on average 1.2707253886010363) internal successors, (21582), 16984 states have internal predecessors, (21582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 21582 transitions. [2025-01-09 00:24:59,927 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 21582 transitions. Word has length 619 [2025-01-09 00:24:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:59,927 INFO L471 AbstractCegarLoop]: Abstraction has 16985 states and 21582 transitions. [2025-01-09 00:24:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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-01-09 00:24:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 21582 transitions. [2025-01-09 00:24:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-01-09 00:24:59,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:59,936 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:24:59,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:24:59,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:59,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 214821060, now seen corresponding path program 1 times [2025-01-09 00:24:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537098828] [2025-01-09 00:24:59,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:00,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-09 00:25:00,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-09 00:25:00,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:00,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 00:25:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537098828] [2025-01-09 00:25:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537098828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075228716] [2025-01-09 00:25:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:00,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:00,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:00,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:00,465 INFO L87 Difference]: Start difference. First operand 16985 states and 21582 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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-01-09 00:25:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:05,258 INFO L93 Difference]: Finished difference Result 43710 states and 57265 transitions. [2025-01-09 00:25:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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 622 [2025-01-09 00:25:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:05,349 INFO L225 Difference]: With dead ends: 43710 [2025-01-09 00:25:05,349 INFO L226 Difference]: Without dead ends: 29457 [2025-01-09 00:25:05,358 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-01-09 00:25:05,359 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 2112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5114 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:05,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 983 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5114 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:25:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29457 states. [2025-01-09 00:25:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29457 to 29454. [2025-01-09 00:25:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29454 states, 29453 states have (on average 1.255593657691916) internal successors, (36981), 29453 states have internal predecessors, (36981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29454 states to 29454 states and 36981 transitions. [2025-01-09 00:25:05,662 INFO L78 Accepts]: Start accepts. Automaton has 29454 states and 36981 transitions. Word has length 622 [2025-01-09 00:25:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:05,664 INFO L471 AbstractCegarLoop]: Abstraction has 29454 states and 36981 transitions. [2025-01-09 00:25:05,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 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-01-09 00:25:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 29454 states and 36981 transitions. [2025-01-09 00:25:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-01-09 00:25:05,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:05,667 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:25:05,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:25:05,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1616426011, now seen corresponding path program 1 times [2025-01-09 00:25:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326819796] [2025-01-09 00:25:05,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:05,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-01-09 00:25:05,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-01-09 00:25:05,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:25:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326819796] [2025-01-09 00:25:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326819796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:06,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:06,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:25:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884595407] [2025-01-09 00:25:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:06,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:25:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:06,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:25:06,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:25:06,590 INFO L87 Difference]: Start difference. First operand 29454 states and 36981 transitions. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:12,798 INFO L93 Difference]: Finished difference Result 63037 states and 78523 transitions. [2025-01-09 00:25:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:25:12,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 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 649 [2025-01-09 00:25:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:12,844 INFO L225 Difference]: With dead ends: 63037 [2025-01-09 00:25:12,844 INFO L226 Difference]: Without dead ends: 36289 [2025-01-09 00:25:12,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:25:12,859 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 2272 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 10028 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 10216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 10028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:12,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 1870 Invalid, 10216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 10028 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 00:25:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36289 states. [2025-01-09 00:25:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36289 to 34921. [2025-01-09 00:25:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34921 states, 34920 states have (on average 1.2223654066437573) internal successors, (42685), 34920 states have internal predecessors, (42685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34921 states to 34921 states and 42685 transitions. [2025-01-09 00:25:13,162 INFO L78 Accepts]: Start accepts. Automaton has 34921 states and 42685 transitions. Word has length 649 [2025-01-09 00:25:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:13,163 INFO L471 AbstractCegarLoop]: Abstraction has 34921 states and 42685 transitions. [2025-01-09 00:25:13,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 34921 states and 42685 transitions. [2025-01-09 00:25:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 00:25:13,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:13,169 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:25:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:25:13,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -847622676, now seen corresponding path program 1 times [2025-01-09 00:25:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749766200] [2025-01-09 00:25:13,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:13,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 00:25:13,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 00:25:13,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:13,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 113 proven. 54 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:25:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749766200] [2025-01-09 00:25:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749766200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:25:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383634071] [2025-01-09 00:25:14,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:25:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:25:14,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:25:14,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:25:14,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 00:25:14,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 00:25:14,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:14,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:25:14,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:25:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:25:14,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:25:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383634071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:25:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:25:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785360925] [2025-01-09 00:25:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:14,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:14,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:14,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:25:14,697 INFO L87 Difference]: Start difference. First operand 34921 states and 42685 transitions. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 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-01-09 00:25:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:19,790 INFO L93 Difference]: Finished difference Result 87633 states and 109678 transitions. [2025-01-09 00:25:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 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 851 [2025-01-09 00:25:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:19,854 INFO L225 Difference]: With dead ends: 87633 [2025-01-09 00:25:19,854 INFO L226 Difference]: Without dead ends: 55444 [2025-01-09 00:25:19,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:25:19,877 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1413 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 4095 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 5766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 4095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:19,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1874 Invalid, 5766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 4095 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 00:25:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55444 states. [2025-01-09 00:25:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55444 to 54041. [2025-01-09 00:25:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54041 states, 54040 states have (on average 1.181661732050333) internal successors, (63857), 54040 states have internal predecessors, (63857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54041 states to 54041 states and 63857 transitions. [2025-01-09 00:25:20,478 INFO L78 Accepts]: Start accepts. Automaton has 54041 states and 63857 transitions. Word has length 851 [2025-01-09 00:25:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:20,480 INFO L471 AbstractCegarLoop]: Abstraction has 54041 states and 63857 transitions. [2025-01-09 00:25:20,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 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-01-09 00:25:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 54041 states and 63857 transitions. [2025-01-09 00:25:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2025-01-09 00:25:20,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:20,488 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:25:20,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:25:20,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:25:20,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2047143733, now seen corresponding path program 1 times [2025-01-09 00:25:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314360992] [2025-01-09 00:25:20,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:20,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 911 statements into 1 equivalence classes. [2025-01-09 00:25:20,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 911 of 911 statements. [2025-01-09 00:25:20,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:20,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-01-09 00:25:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314360992] [2025-01-09 00:25:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314360992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:21,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:21,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:25:21,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387517982] [2025-01-09 00:25:21,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:25:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:21,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:25:21,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:25:21,278 INFO L87 Difference]: Start difference. First operand 54041 states and 63857 transitions. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:29,370 INFO L93 Difference]: Finished difference Result 172462 states and 208118 transitions. [2025-01-09 00:25:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:25:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 911 [2025-01-09 00:25:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:29,478 INFO L225 Difference]: With dead ends: 172462 [2025-01-09 00:25:29,478 INFO L226 Difference]: Without dead ends: 121153 [2025-01-09 00:25:29,499 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-01-09 00:25:29,499 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 3214 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 8806 mSolverCounterSat, 2789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3214 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 11595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2789 IncrementalHoareTripleChecker+Valid, 8806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:29,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3214 Valid, 1285 Invalid, 11595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2789 Valid, 8806 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 00:25:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121153 states. [2025-01-09 00:25:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121153 to 103285. [2025-01-09 00:25:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103285 states, 103284 states have (on average 1.1896905619457032) internal successors, (122876), 103284 states have internal predecessors, (122876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103285 states to 103285 states and 122876 transitions. [2025-01-09 00:25:30,558 INFO L78 Accepts]: Start accepts. Automaton has 103285 states and 122876 transitions. Word has length 911 [2025-01-09 00:25:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 103285 states and 122876 transitions. [2025-01-09 00:25:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 103285 states and 122876 transitions. [2025-01-09 00:25:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2025-01-09 00:25:30,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:30,566 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:25:30,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:25:30,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:30,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1904865487, now seen corresponding path program 1 times [2025-01-09 00:25:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:30,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614277099] [2025-01-09 00:25:30,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:30,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 961 statements into 1 equivalence classes. [2025-01-09 00:25:30,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 961 of 961 statements. [2025-01-09 00:25:30,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:30,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:25:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614277099] [2025-01-09 00:25:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614277099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:25:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341678361] [2025-01-09 00:25:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:31,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:31,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:31,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:31,179 INFO L87 Difference]: Start difference. First operand 103285 states and 122876 transitions. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:35,759 INFO L93 Difference]: Finished difference Result 207939 states and 247225 transitions. [2025-01-09 00:25:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 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 961 [2025-01-09 00:25:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:35,864 INFO L225 Difference]: With dead ends: 207939 [2025-01-09 00:25:35,864 INFO L226 Difference]: Without dead ends: 104656 [2025-01-09 00:25:35,904 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-01-09 00:25:35,905 INFO L435 NwaCegarLoop]: 2882 mSDtfsCounter, 1495 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 1477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 5152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1477 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:35,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 3068 Invalid, 5152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1477 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 00:25:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104656 states. [2025-01-09 00:25:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104656 to 103280. [2025-01-09 00:25:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103280 states, 103279 states have (on average 1.1358068920109605) internal successors, (117305), 103279 states have internal predecessors, (117305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103280 states to 103280 states and 117305 transitions. [2025-01-09 00:25:36,934 INFO L78 Accepts]: Start accepts. Automaton has 103280 states and 117305 transitions. Word has length 961 [2025-01-09 00:25:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:36,935 INFO L471 AbstractCegarLoop]: Abstraction has 103280 states and 117305 transitions. [2025-01-09 00:25:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:25:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 103280 states and 117305 transitions. [2025-01-09 00:25:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2025-01-09 00:25:36,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:36,942 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:25:36,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:25:36,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:36,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash -113743848, now seen corresponding path program 1 times [2025-01-09 00:25:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:36,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443506388] [2025-01-09 00:25:36,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:36,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:37,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-01-09 00:25:37,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-01-09 00:25:37,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:37,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat