./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ae5a79d1f1baf1f14454f65e56a4602af56e479a8b0432aa823cab3749bdff6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:01:46,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:01:47,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:01:47,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:01:47,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:01:47,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:01:47,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:01:47,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:01:47,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:01:47,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:01:47,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:01:47,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:01:47,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:01:47,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:01:47,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:01:47,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:01:47,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:01:47,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:01:47,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:01:47,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:01:47,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:01:47,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:01:47,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:01:47,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:01:47,090 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ae5a79d1f1baf1f14454f65e56a4602af56e479a8b0432aa823cab3749bdff6 [2025-03-03 16:01:47,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:01:47,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:01:47,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:01:47,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:01:47,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:01:47,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c [2025-03-03 16:01:48,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dae8da44/d3e0badd283949b68b8c496978895065/FLAGc193ceca2 [2025-03-03 16:01:49,018 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:01:49,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c [2025-03-03 16:01:49,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dae8da44/d3e0badd283949b68b8c496978895065/FLAGc193ceca2 [2025-03-03 16:01:49,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dae8da44/d3e0badd283949b68b8c496978895065 [2025-03-03 16:01:49,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:01:49,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:01:49,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:01:49,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:01:49,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:01:49,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:49" (1/1) ... [2025-03-03 16:01:49,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3642aa9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:49, skipping insertion in model container [2025-03-03 16:01:49,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:49" (1/1) ... [2025-03-03 16:01:49,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:01:49,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c[6354,6367] [2025-03-03 16:01:49,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c[13290,13303] [2025-03-03 16:01:49,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:01:49,939 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:01:49,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c[6354,6367] [2025-03-03 16:01:49,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c[13290,13303] [2025-03-03 16:01:50,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:01:50,241 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:01:50,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50 WrapperNode [2025-03-03 16:01:50,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:01:50,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:01:50,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:01:50,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:01:50,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,512 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-03-03 16:01:50,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:01:50,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:01:50,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:01:50,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:01:50,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:01:50,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:01:50,942 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:01:50,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:01:50,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:01:50,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (1/1) ... [2025-03-03 16:01:50,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:01:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:50,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:01:50,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:01:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:01:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:01:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:01:50,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:01:51,055 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:01:51,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:01:54,138 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2025-03-03 16:01:54,138 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2025-03-03 16:01:54,138 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2025-03-03 16:01:54,274 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-03-03 16:01:54,274 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:01:54,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:01:54,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:01:54,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:01:54 BoogieIcfgContainer [2025-03-03 16:01:54,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:01:54,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:01:54,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:01:54,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:01:54,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:01:49" (1/3) ... [2025-03-03 16:01:54,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fc2621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:54, skipping insertion in model container [2025-03-03 16:01:54,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:50" (2/3) ... [2025-03-03 16:01:54,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fc2621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:54, skipping insertion in model container [2025-03-03 16:01:54,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:01:54" (3/3) ... [2025-03-03 16:01:54,314 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c [2025-03-03 16:01:54,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:01:54,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label05.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:01:54,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:01:54,398 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;@60672579, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:01:54,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:01:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:01:54,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:54,409 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] [2025-03-03 16:01:54,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1636970803, now seen corresponding path program 1 times [2025-03-03 16:01:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:54,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550465627] [2025-03-03 16:01:54,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:54,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:01:54,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:01:54,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:54,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:54,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550465627] [2025-03-03 16:01:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550465627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:01:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831870657] [2025-03-03 16:01:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:54,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:01:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:54,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:01:54,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:01:54,595 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:54,669 INFO L93 Difference]: Finished difference Result 1720 states and 3268 transitions. [2025-03-03 16:01:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:01:54,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-03 16:01:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:54,680 INFO L225 Difference]: With dead ends: 1720 [2025-03-03 16:01:54,680 INFO L226 Difference]: Without dead ends: 806 [2025-03-03 16:01:54,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:01:54,687 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:54,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-03 16:01:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-03-03 16:01:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-03-03 16:01:54,747 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-03-03 16:01:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:54,747 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-03-03 16:01:54,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-03-03 16:01:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:01:54,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:54,748 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] [2025-03-03 16:01:54,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:01:54,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:54,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-03-03 16:01:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107571488] [2025-03-03 16:01:54,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:01:54,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:01:54,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:54,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107571488] [2025-03-03 16:01:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107571488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249917919] [2025-03-03 16:01:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:54,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:54,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:54,923 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:55,010 INFO L93 Difference]: Finished difference Result 870 states and 1622 transitions. [2025-03-03 16:01:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:55,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-03 16:01:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:55,014 INFO L225 Difference]: With dead ends: 870 [2025-03-03 16:01:55,014 INFO L226 Difference]: Without dead ends: 836 [2025-03-03 16:01:55,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:55,015 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:55,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-03 16:01:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 806. [2025-03-03 16:01:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-03-03 16:01:55,037 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-03-03 16:01:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:55,037 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-03-03 16:01:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-03-03 16:01:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 16:01:55,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:55,038 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] [2025-03-03 16:01:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:01:55,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-03-03 16:01:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060577460] [2025-03-03 16:01:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:55,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 16:01:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 16:01:55,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:55,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060577460] [2025-03-03 16:01:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060577460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779069816] [2025-03-03 16:01:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:55,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:55,169 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:55,276 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-03-03 16:01:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:01:55,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-03 16:01:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:55,280 INFO L225 Difference]: With dead ends: 986 [2025-03-03 16:01:55,280 INFO L226 Difference]: Without dead ends: 956 [2025-03-03 16:01:55,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:55,281 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:55,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:01:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-03 16:01:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-03-03 16:01:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-03-03 16:01:55,302 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-03-03 16:01:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-03-03 16:01:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-03-03 16:01:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:01:55,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:55,306 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] [2025-03-03 16:01:55,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:01:55,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-03-03 16:01:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666135807] [2025-03-03 16:01:55,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:55,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:01:55,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:01:55,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:55,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666135807] [2025-03-03 16:01:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666135807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662108887] [2025-03-03 16:01:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:55,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:55,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:55,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:55,391 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:55,419 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-03-03 16:01:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 16:01:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:55,422 INFO L225 Difference]: With dead ends: 939 [2025-03-03 16:01:55,423 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:01:55,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:55,423 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:55,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:01:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 16:01:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-03-03 16:01:55,444 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-03-03 16:01:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:55,445 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-03-03 16:01:55,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-03-03 16:01:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:01:55,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:55,446 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] [2025-03-03 16:01:55,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:01:55,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-03-03 16:01:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778516066] [2025-03-03 16:01:55,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:55,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:01:55,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:01:55,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:55,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778516066] [2025-03-03 16:01:55,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778516066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:55,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:55,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928986601] [2025-03-03 16:01:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:55,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:55,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:55,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:55,596 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:55,660 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-03-03 16:01:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:55,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 16:01:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:55,663 INFO L225 Difference]: With dead ends: 984 [2025-03-03 16:01:55,664 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:01:55,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:01:55,666 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 1475 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:55,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:01:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 16:01:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-03-03 16:01:55,686 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-03-03 16:01:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:55,687 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-03-03 16:01:55,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-03-03 16:01:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 16:01:55,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:55,689 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] [2025-03-03 16:01:55,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:01:55,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-03-03 16:01:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130616781] [2025-03-03 16:01:55,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:55,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 16:01:55,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 16:01:55,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:55,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:55,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130616781] [2025-03-03 16:01:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130616781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:01:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257367445] [2025-03-03 16:01:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:01:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:01:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:55,875 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:55,939 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-03-03 16:01:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:01:55,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 16:01:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:55,943 INFO L225 Difference]: With dead ends: 887 [2025-03-03 16:01:55,943 INFO L226 Difference]: Without dead ends: 885 [2025-03-03 16:01:55,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:55,944 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8996 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10498 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:55,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10498 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-03 16:01:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-03-03 16:01:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-03-03 16:01:55,963 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-03-03 16:01:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-03-03 16:01:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-03-03 16:01:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:55,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:55,964 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] [2025-03-03 16:01:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:01:55,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-03-03 16:01:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044969773] [2025-03-03 16:01:55,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:55,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:55,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:55,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:55,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044969773] [2025-03-03 16:01:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044969773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:56,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954281021] [2025-03-03 16:01:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:56,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:56,031 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:56,050 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-03-03 16:01:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:56,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:01:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:56,053 INFO L225 Difference]: With dead ends: 1007 [2025-03-03 16:01:56,053 INFO L226 Difference]: Without dead ends: 943 [2025-03-03 16:01:56,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:56,054 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:56,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-03 16:01:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-03-03 16:01:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-03-03 16:01:56,069 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-03-03 16:01:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:56,069 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-03-03 16:01:56,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-03-03 16:01:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:56,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:56,070 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] [2025-03-03 16:01:56,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:01:56,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:56,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-03-03 16:01:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:56,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054326097] [2025-03-03 16:01:56,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:56,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:56,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:56,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054326097] [2025-03-03 16:01:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054326097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:56,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37007929] [2025-03-03 16:01:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:56,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:56,103 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:56,124 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-03-03 16:01:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:01:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:56,129 INFO L225 Difference]: With dead ends: 1243 [2025-03-03 16:01:56,129 INFO L226 Difference]: Without dead ends: 1080 [2025-03-03 16:01:56,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:56,131 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:56,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-03-03 16:01:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-03-03 16:01:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-03-03 16:01:56,150 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-03-03 16:01:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:56,151 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-03-03 16:01:56,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-03-03 16:01:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:56,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:56,151 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] [2025-03-03 16:01:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:01:56,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-03-03 16:01:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495100040] [2025-03-03 16:01:56,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:56,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:56,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:56,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495100040] [2025-03-03 16:01:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495100040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:56,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:56,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919776608] [2025-03-03 16:01:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:56,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:56,195 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:56,218 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-03-03 16:01:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:56,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:01:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:56,223 INFO L225 Difference]: With dead ends: 1630 [2025-03-03 16:01:56,223 INFO L226 Difference]: Without dead ends: 1330 [2025-03-03 16:01:56,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:56,224 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:56,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-03 16:01:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-03-03 16:01:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-03-03 16:01:56,248 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-03-03 16:01:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:56,248 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-03-03 16:01:56,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-03-03 16:01:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:56,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:56,249 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:01:56,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:01:56,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:56,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-03-03 16:01:56,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:56,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385535567] [2025-03-03 16:01:56,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:56,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:56,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385535567] [2025-03-03 16:01:56,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385535567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044998684] [2025-03-03 16:01:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:56,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:56,342 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:56,429 INFO L93 Difference]: Finished difference Result 2960 states and 4508 transitions. [2025-03-03 16:01:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 54 [2025-03-03 16:01:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:56,438 INFO L225 Difference]: With dead ends: 2960 [2025-03-03 16:01:56,438 INFO L226 Difference]: Without dead ends: 2558 [2025-03-03 16:01:56,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:01:56,439 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3037 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3037 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:56,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3037 Valid, 3172 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-03 16:01:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1804. [2025-03-03 16:01:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1802 states have (on average 1.602663706992231) internal successors, (2888), 1803 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2888 transitions. [2025-03-03 16:01:56,478 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2888 transitions. Word has length 54 [2025-03-03 16:01:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2888 transitions. [2025-03-03 16:01:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2888 transitions. [2025-03-03 16:01:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:56,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:56,480 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:01:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:01:56,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:56,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-03-03 16:01:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823839882] [2025-03-03 16:01:56,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:56,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:56,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:56,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:01:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823839882] [2025-03-03 16:01:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823839882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:56,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:56,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881917395] [2025-03-03 16:01:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:56,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:56,571 INFO L87 Difference]: Start difference. First operand 1804 states and 2888 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:56,646 INFO L93 Difference]: Finished difference Result 3508 states and 5268 transitions. [2025-03-03 16:01:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2025-03-03 16:01:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:56,655 INFO L225 Difference]: With dead ends: 3508 [2025-03-03 16:01:56,656 INFO L226 Difference]: Without dead ends: 2958 [2025-03-03 16:01:56,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:01:56,658 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:56,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-03-03 16:01:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2552. [2025-03-03 16:01:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5356862745098039) internal successors, (3916), 2551 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3916 transitions. [2025-03-03 16:01:56,712 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3916 transitions. Word has length 54 [2025-03-03 16:01:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3916 transitions. [2025-03-03 16:01:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3916 transitions. [2025-03-03 16:01:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:56,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:56,714 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:01:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:01:56,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:56,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-03-03 16:01:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830005746] [2025-03-03 16:01:56,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:56,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:56,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:01:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830005746] [2025-03-03 16:01:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830005746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885385569] [2025-03-03 16:01:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:56,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:56,783 INFO L87 Difference]: Start difference. First operand 2552 states and 3916 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:56,864 INFO L93 Difference]: Finished difference Result 4056 states and 6024 transitions. [2025-03-03 16:01:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2025-03-03 16:01:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:56,874 INFO L225 Difference]: With dead ends: 4056 [2025-03-03 16:01:56,874 INFO L226 Difference]: Without dead ends: 3506 [2025-03-03 16:01:56,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:01:56,876 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:56,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-03-03 16:01:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3100. [2025-03-03 16:01:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.5080697224015494) internal successors, (4672), 3099 states have internal predecessors, (4672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4672 transitions. [2025-03-03 16:01:56,937 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4672 transitions. Word has length 54 [2025-03-03 16:01:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:56,937 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4672 transitions. [2025-03-03 16:01:56,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4672 transitions. [2025-03-03 16:01:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 16:01:56,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:56,942 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:01:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:01:56,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-03-03 16:01:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593733370] [2025-03-03 16:01:56,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 16:01:56,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 16:01:56,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593733370] [2025-03-03 16:01:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593733370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:57,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:57,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071698838] [2025-03-03 16:01:57,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:57,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:57,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:57,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:57,008 INFO L87 Difference]: Start difference. First operand 3100 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:57,050 INFO L93 Difference]: Finished difference Result 5424 states and 7882 transitions. [2025-03-03 16:01:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:57,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 16:01:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:57,058 INFO L225 Difference]: With dead ends: 5424 [2025-03-03 16:01:57,058 INFO L226 Difference]: Without dead ends: 3102 [2025-03-03 16:01:57,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:57,061 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:57,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-03-03 16:01:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3100. [2025-03-03 16:01:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.4919302775984506) internal successors, (4622), 3099 states have internal predecessors, (4622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4622 transitions. [2025-03-03 16:01:57,114 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4622 transitions. Word has length 55 [2025-03-03 16:01:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4622 transitions. [2025-03-03 16:01:57,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4622 transitions. [2025-03-03 16:01:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:01:57,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:57,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:57,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:01:57,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-03-03 16:01:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161263165] [2025-03-03 16:01:57,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:01:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:01:57,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:57,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161263165] [2025-03-03 16:01:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161263165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:57,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:57,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:57,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239489590] [2025-03-03 16:01:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:57,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:57,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:57,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:57,172 INFO L87 Difference]: Start difference. First operand 3100 states and 4622 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:57,202 INFO L93 Difference]: Finished difference Result 4019 states and 5882 transitions. [2025-03-03 16:01:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 16:01:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:57,206 INFO L225 Difference]: With dead ends: 4019 [2025-03-03 16:01:57,206 INFO L226 Difference]: Without dead ends: 1697 [2025-03-03 16:01:57,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:57,209 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:57,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-03 16:01:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1689. [2025-03-03 16:01:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5986959098992295) internal successors, (2697), 1688 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2697 transitions. [2025-03-03 16:01:57,286 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2697 transitions. Word has length 56 [2025-03-03 16:01:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:57,286 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2697 transitions. [2025-03-03 16:01:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2697 transitions. [2025-03-03 16:01:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:01:57,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:57,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:01:57,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:57,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-03-03 16:01:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:57,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962457699] [2025-03-03 16:01:57,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:57,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:57,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:01:57,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:01:57,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:57,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962457699] [2025-03-03 16:01:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962457699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:57,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:57,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783197447] [2025-03-03 16:01:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:57,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:57,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:57,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:57,345 INFO L87 Difference]: Start difference. First operand 1689 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:57,366 INFO L93 Difference]: Finished difference Result 2143 states and 3311 transitions. [2025-03-03 16:01:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 16:01:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:57,373 INFO L225 Difference]: With dead ends: 2143 [2025-03-03 16:01:57,373 INFO L226 Difference]: Without dead ends: 1241 [2025-03-03 16:01:57,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:57,376 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:57,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-03 16:01:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-03 16:01:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1237 states have (on average 1.6782538399353275) internal successors, (2076), 1238 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2076 transitions. [2025-03-03 16:01:57,393 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2076 transitions. Word has length 57 [2025-03-03 16:01:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:57,393 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2076 transitions. [2025-03-03 16:01:57,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:01:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2076 transitions. [2025-03-03 16:01:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:01:57,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:57,394 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:01:57,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:01:57,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:57,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-03-03 16:01:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:57,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089150317] [2025-03-03 16:01:57,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:57,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:01:57,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:01:57,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089150317] [2025-03-03 16:01:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089150317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218715672] [2025-03-03 16:01:58,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:58,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:58,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:58,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:58,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:01:58,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:01:58,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:01:58,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:58,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:58,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 16:01:58,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:58,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218715672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:58,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-03-03 16:01:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263181792] [2025-03-03 16:01:58,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:01:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:58,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:01:58,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:01:58,955 INFO L87 Difference]: Start difference. First operand 1239 states and 2076 transitions. Second operand has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:00,856 INFO L93 Difference]: Finished difference Result 3409 states and 4899 transitions. [2025-03-03 16:02:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 16:02:00,857 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 16:02:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:00,864 INFO L225 Difference]: With dead ends: 3409 [2025-03-03 16:02:00,866 INFO L226 Difference]: Without dead ends: 2957 [2025-03-03 16:02:00,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 16:02:00,868 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 15300 mSDsluCounter, 6299 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15300 SdHoareTripleChecker+Valid, 7810 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:00,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15300 Valid, 7810 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:02:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2025-03-03 16:02:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2795. [2025-03-03 16:02:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2793 states have (on average 1.4375223773720014) internal successors, (4015), 2794 states have internal predecessors, (4015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 4015 transitions. [2025-03-03 16:02:00,936 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 4015 transitions. Word has length 59 [2025-03-03 16:02:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:00,936 INFO L471 AbstractCegarLoop]: Abstraction has 2795 states and 4015 transitions. [2025-03-03 16:02:00,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 4015 transitions. [2025-03-03 16:02:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:02:00,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:00,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:00,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:02:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:02:01,141 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:01,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1652376586, now seen corresponding path program 1 times [2025-03-03 16:02:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248439084] [2025-03-03 16:02:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:01,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:01,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:01,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:01,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248439084] [2025-03-03 16:02:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248439084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:01,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:01,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577750512] [2025-03-03 16:02:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:02:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:01,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:02:01,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:02:01,228 INFO L87 Difference]: Start difference. First operand 2795 states and 4015 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:05,328 INFO L93 Difference]: Finished difference Result 5050 states and 8324 transitions. [2025-03-03 16:02:05,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:02:05,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 16:02:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:05,335 INFO L225 Difference]: With dead ends: 5050 [2025-03-03 16:02:05,335 INFO L226 Difference]: Without dead ends: 4297 [2025-03-03 16:02:05,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:02:05,336 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 2319 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:05,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 780 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 16:02:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2025-03-03 16:02:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4297. [2025-03-03 16:02:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 4295 states have (on average 1.429802095459837) internal successors, (6141), 4296 states have internal predecessors, (6141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6141 transitions. [2025-03-03 16:02:05,400 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6141 transitions. Word has length 60 [2025-03-03 16:02:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:05,400 INFO L471 AbstractCegarLoop]: Abstraction has 4297 states and 6141 transitions. [2025-03-03 16:02:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6141 transitions. [2025-03-03 16:02:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:02:05,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:05,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:02:05,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-03-03 16:02:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962861390] [2025-03-03 16:02:05,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:05,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:05,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962861390] [2025-03-03 16:02:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962861390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492323790] [2025-03-03 16:02:05,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:05,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:05,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:05,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:05,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:02:05,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:05,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:05,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:05,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:05,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 16:02:05,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:06,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:07,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492323790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:07,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-03-03 16:02:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452041069] [2025-03-03 16:02:07,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 16:02:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:07,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 16:02:07,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2025-03-03 16:02:07,428 INFO L87 Difference]: Start difference. First operand 4297 states and 6141 transitions. Second operand has 31 states, 31 states have (on average 5.225806451612903) internal successors, (162), 31 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:08,425 INFO L93 Difference]: Finished difference Result 9399 states and 12638 transitions. [2025-03-03 16:02:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:02:08,426 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.225806451612903) internal successors, (162), 31 states have internal predecessors, (162), 0 states have call successors, (0), 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 60 [2025-03-03 16:02:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:08,437 INFO L225 Difference]: With dead ends: 9399 [2025-03-03 16:02:08,438 INFO L226 Difference]: Without dead ends: 7673 [2025-03-03 16:02:08,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=802, Invalid=2390, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 16:02:08,442 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 8489 mSDsluCounter, 4762 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8489 SdHoareTripleChecker+Valid, 6249 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:08,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8489 Valid, 6249 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:02:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2025-03-03 16:02:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 7459. [2025-03-03 16:02:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7459 states, 7457 states have (on average 1.3462518439050557) internal successors, (10039), 7458 states have internal predecessors, (10039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7459 states to 7459 states and 10039 transitions. [2025-03-03 16:02:08,638 INFO L78 Accepts]: Start accepts. Automaton has 7459 states and 10039 transitions. Word has length 60 [2025-03-03 16:02:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:08,638 INFO L471 AbstractCegarLoop]: Abstraction has 7459 states and 10039 transitions. [2025-03-03 16:02:08,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.225806451612903) internal successors, (162), 31 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7459 states and 10039 transitions. [2025-03-03 16:02:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:02:08,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:08,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:08,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:02:08,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:02:08,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1592793716, now seen corresponding path program 1 times [2025-03-03 16:02:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:08,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226106178] [2025-03-03 16:02:08,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:08,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:08,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:08,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:08,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226106178] [2025-03-03 16:02:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226106178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649388356] [2025-03-03 16:02:09,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:09,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:09,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:02:09,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:09,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:02:09,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:09,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:09,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649388356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:09,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:09,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:02:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947729911] [2025-03-03 16:02:09,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:09,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:02:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:09,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:02:09,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:02:09,828 INFO L87 Difference]: Start difference. First operand 7459 states and 10039 transitions. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:10,185 INFO L93 Difference]: Finished difference Result 12051 states and 15824 transitions. [2025-03-03 16:02:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:02:10,186 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 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 60 [2025-03-03 16:02:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:10,197 INFO L225 Difference]: With dead ends: 12051 [2025-03-03 16:02:10,197 INFO L226 Difference]: Without dead ends: 7703 [2025-03-03 16:02:10,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:02:10,202 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 13508 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13508 SdHoareTripleChecker+Valid, 4621 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:10,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13508 Valid, 4621 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:02:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7703 states. [2025-03-03 16:02:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7703 to 7443. [2025-03-03 16:02:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7441 states have (on average 1.3404112350490525) internal successors, (9974), 7442 states have internal predecessors, (9974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9974 transitions. [2025-03-03 16:02:10,370 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9974 transitions. Word has length 60 [2025-03-03 16:02:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:10,370 INFO L471 AbstractCegarLoop]: Abstraction has 7443 states and 9974 transitions. [2025-03-03 16:02:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9974 transitions. [2025-03-03 16:02:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:02:10,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:10,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:10,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:02:10,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:10,572 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:10,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash -506964052, now seen corresponding path program 1 times [2025-03-03 16:02:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498316281] [2025-03-03 16:02:10,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:10,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:10,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:10,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:10,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498316281] [2025-03-03 16:02:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498316281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459355050] [2025-03-03 16:02:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:10,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:10,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:10,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:02:10,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:02:10,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:02:10,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:10,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:10,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:02:10,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:11,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459355050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:11,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:02:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113516891] [2025-03-03 16:02:11,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:11,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:02:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:11,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:02:11,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:02:11,495 INFO L87 Difference]: Start difference. First operand 7443 states and 9974 transitions. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 20 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:11,904 INFO L93 Difference]: Finished difference Result 16546 states and 21236 transitions. [2025-03-03 16:02:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:02:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 20 states have internal predecessors, (122), 0 states have call successors, (0), 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 60 [2025-03-03 16:02:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:11,918 INFO L225 Difference]: With dead ends: 16546 [2025-03-03 16:02:11,918 INFO L226 Difference]: Without dead ends: 12008 [2025-03-03 16:02:11,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-03 16:02:11,924 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 7469 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7469 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:11,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7469 Valid, 4753 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:02:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12008 states. [2025-03-03 16:02:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12008 to 12004. [2025-03-03 16:02:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12004 states, 12002 states have (on average 1.2934510914847526) internal successors, (15524), 12003 states have internal predecessors, (15524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12004 states to 12004 states and 15524 transitions. [2025-03-03 16:02:12,144 INFO L78 Accepts]: Start accepts. Automaton has 12004 states and 15524 transitions. Word has length 60 [2025-03-03 16:02:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:12,144 INFO L471 AbstractCegarLoop]: Abstraction has 12004 states and 15524 transitions. [2025-03-03 16:02:12,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 20 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12004 states and 15524 transitions. [2025-03-03 16:02:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:02:12,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:12,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:12,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:02:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:12,346 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991069, now seen corresponding path program 1 times [2025-03-03 16:02:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905049514] [2025-03-03 16:02:12,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:12,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:12,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:12,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905049514] [2025-03-03 16:02:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905049514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314639998] [2025-03-03 16:02:13,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:13,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:13,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:13,619 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:13,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:02:13,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:13,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:13,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:13,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:13,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 16:02:13,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:14,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314639998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:15,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:15,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2025-03-03 16:02:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128507149] [2025-03-03 16:02:15,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 16:02:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 16:02:15,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2060, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 16:02:15,637 INFO L87 Difference]: Start difference. First operand 12004 states and 15524 transitions. Second operand has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:33,009 INFO L93 Difference]: Finished difference Result 25818 states and 32539 transitions. [2025-03-03 16:02:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-03-03 16:02:33,009 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 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 61 [2025-03-03 16:02:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:33,030 INFO L225 Difference]: With dead ends: 25818 [2025-03-03 16:02:33,031 INFO L226 Difference]: Without dead ends: 20760 [2025-03-03 16:02:33,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12774 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=7312, Invalid=27844, Unknown=0, NotChecked=0, Total=35156 [2025-03-03 16:02:33,042 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 21478 mSDsluCounter, 26531 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21478 SdHoareTripleChecker+Valid, 28080 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:33,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21478 Valid, 28080 Invalid, 2336 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [247 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 16:02:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20760 states. [2025-03-03 16:02:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20760 to 12427. [2025-03-03 16:02:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12427 states, 12425 states have (on average 1.2870020120724346) internal successors, (15991), 12426 states have internal predecessors, (15991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12427 states to 12427 states and 15991 transitions. [2025-03-03 16:02:33,539 INFO L78 Accepts]: Start accepts. Automaton has 12427 states and 15991 transitions. Word has length 61 [2025-03-03 16:02:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:33,540 INFO L471 AbstractCegarLoop]: Abstraction has 12427 states and 15991 transitions. [2025-03-03 16:02:33,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.4583333333333335) internal successors, (166), 48 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 12427 states and 15991 transitions. [2025-03-03 16:02:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:02:33,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:33,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:33,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 16:02:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:33,742 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1245500193, now seen corresponding path program 1 times [2025-03-03 16:02:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421555685] [2025-03-03 16:02:33,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:33,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:33,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:33,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:33,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421555685] [2025-03-03 16:02:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421555685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612415847] [2025-03-03 16:02:34,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:34,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:34,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:34,222 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:02:34,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:34,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:34,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:34,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:34,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:02:34,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:34,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612415847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:35,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 29 [2025-03-03 16:02:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947863693] [2025-03-03 16:02:35,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:35,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 16:02:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:35,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 16:02:35,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-03-03 16:02:35,202 INFO L87 Difference]: Start difference. First operand 12427 states and 15991 transitions. Second operand has 29 states, 29 states have (on average 4.655172413793103) internal successors, (135), 29 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:36,097 INFO L93 Difference]: Finished difference Result 16854 states and 21425 transitions. [2025-03-03 16:02:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 16:02:36,100 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.655172413793103) internal successors, (135), 29 states have internal predecessors, (135), 0 states have call successors, (0), 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 61 [2025-03-03 16:02:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:36,111 INFO L225 Difference]: With dead ends: 16854 [2025-03-03 16:02:36,111 INFO L226 Difference]: Without dead ends: 12143 [2025-03-03 16:02:36,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 16:02:36,117 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 9366 mSDsluCounter, 11924 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9366 SdHoareTripleChecker+Valid, 13419 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:36,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9366 Valid, 13419 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:02:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12143 states. [2025-03-03 16:02:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12143 to 10562. [2025-03-03 16:02:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10562 states, 10560 states have (on average 1.2976325757575757) internal successors, (13703), 10561 states have internal predecessors, (13703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 13703 transitions. [2025-03-03 16:02:36,422 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 13703 transitions. Word has length 61 [2025-03-03 16:02:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:36,423 INFO L471 AbstractCegarLoop]: Abstraction has 10562 states and 13703 transitions. [2025-03-03 16:02:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.655172413793103) internal successors, (135), 29 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:02:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 13703 transitions. [2025-03-03 16:02:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 16:02:36,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:36,424 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:02:36,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 16:02:36,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:36,628 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1435836916, now seen corresponding path program 1 times [2025-03-03 16:02:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359239329] [2025-03-03 16:02:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:36,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:02:36,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:02:36,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:36,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:37,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:37,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359239329] [2025-03-03 16:02:37,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359239329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:37,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733165498] [2025-03-03 16:02:37,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:37,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:37,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:37,459 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:37,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:02:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:02:37,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:02:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:37,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 16:02:37,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:39,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733165498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:41,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:41,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 17] total 57 [2025-03-03 16:02:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671241578] [2025-03-03 16:02:41,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:41,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 16:02:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:41,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 16:02:41,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2841, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 16:02:41,374 INFO L87 Difference]: Start difference. First operand 10562 states and 13703 transitions. Second operand has 57 states, 57 states have (on average 2.9473684210526314) internal successors, (168), 57 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:05,284 INFO L93 Difference]: Finished difference Result 22914 states and 28874 transitions. [2025-03-03 16:03:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-03-03 16:03:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.9473684210526314) internal successors, (168), 57 states have internal predecessors, (168), 0 states have call successors, (0), 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 62 [2025-03-03 16:03:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:05,304 INFO L225 Difference]: With dead ends: 22914 [2025-03-03 16:03:05,304 INFO L226 Difference]: Without dead ends: 21062 [2025-03-03 16:03:05,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12748 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=6385, Invalid=30287, Unknown=0, NotChecked=0, Total=36672 [2025-03-03 16:03:05,312 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 28316 mSDsluCounter, 24586 mSDsCounter, 0 mSdLazyCounter, 3352 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28316 SdHoareTripleChecker+Valid, 26138 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 3352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:05,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28316 Valid, 26138 Invalid, 3497 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [145 Valid, 3352 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 16:03:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2025-03-03 16:03:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 10906. [2025-03-03 16:03:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10906 states, 10904 states have (on average 1.2945707997065297) internal successors, (14116), 10905 states have internal predecessors, (14116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10906 states to 10906 states and 14116 transitions. [2025-03-03 16:03:05,773 INFO L78 Accepts]: Start accepts. Automaton has 10906 states and 14116 transitions. Word has length 62 [2025-03-03 16:03:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:05,773 INFO L471 AbstractCegarLoop]: Abstraction has 10906 states and 14116 transitions. [2025-03-03 16:03:05,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.9473684210526314) internal successors, (168), 57 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10906 states and 14116 transitions. [2025-03-03 16:03:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:03:05,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:05,774 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:03:05,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 16:03:05,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:05,974 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:05,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1042667455, now seen corresponding path program 1 times [2025-03-03 16:03:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:05,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145115499] [2025-03-03 16:03:05,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:05,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:03:05,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:03:05,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:05,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145115499] [2025-03-03 16:03:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145115499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:03:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672707851] [2025-03-03 16:03:06,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:03:06,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:03:06,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:03:06,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:03:06,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:03:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:06,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 16:03:06,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:03:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:07,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:03:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672707851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:03:09,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:03:09,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 19] total 46 [2025-03-03 16:03:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830414860] [2025-03-03 16:03:09,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:03:09,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 16:03:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:03:09,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 16:03:09,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 16:03:09,471 INFO L87 Difference]: Start difference. First operand 10906 states and 14116 transitions. Second operand has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:12,368 INFO L93 Difference]: Finished difference Result 16910 states and 21592 transitions. [2025-03-03 16:03:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 16:03:12,369 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 16:03:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:12,379 INFO L225 Difference]: With dead ends: 16910 [2025-03-03 16:03:12,379 INFO L226 Difference]: Without dead ends: 12518 [2025-03-03 16:03:12,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1423, Invalid=4897, Unknown=0, NotChecked=0, Total=6320 [2025-03-03 16:03:12,384 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 23332 mSDsluCounter, 18208 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23332 SdHoareTripleChecker+Valid, 19724 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:12,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23332 Valid, 19724 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:03:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2025-03-03 16:03:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 8520. [2025-03-03 16:03:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8520 states, 8518 states have (on average 1.3147452453627613) internal successors, (11199), 8519 states have internal predecessors, (11199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8520 states to 8520 states and 11199 transitions. [2025-03-03 16:03:12,732 INFO L78 Accepts]: Start accepts. Automaton has 8520 states and 11199 transitions. Word has length 63 [2025-03-03 16:03:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:12,733 INFO L471 AbstractCegarLoop]: Abstraction has 8520 states and 11199 transitions. [2025-03-03 16:03:12,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:03:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8520 states and 11199 transitions. [2025-03-03 16:03:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:03:12,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:12,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:03:12,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 16:03:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 16:03:12,935 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -734107476, now seen corresponding path program 1 times [2025-03-03 16:03:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287064477] [2025-03-03 16:03:12,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:12,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:03:12,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:03:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:12,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 32 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:03:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287064477] [2025-03-03 16:03:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287064477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:03:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634726869] [2025-03-03 16:03:13,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:13,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:13,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:03:13,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:03:13,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 16:03:13,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:03:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:03:13,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:13,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:13,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 16:03:13,434 INFO L279 TraceCheckSpWp]: Computing forward predicates...