./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.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_label02.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 d7b7824f74ab8cbbea36fdaee1d1dc5c7e52c10bcc21a0858c24d31348bf95ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:01:35,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:01:35,286 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:35,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:01:35,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:01:35,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:01:35,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:01:35,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:01:35,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:01:35,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:01:35,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:01:35,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:01:35,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:01:35,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:01:35,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:01:35,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:01:35,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:01:35,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:01:35,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:01:35,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:01:35,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:01:35,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:01:35,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:01:35,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:01:35,315 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 -> d7b7824f74ab8cbbea36fdaee1d1dc5c7e52c10bcc21a0858c24d31348bf95ad [2025-03-03 16:01:35,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:01:35,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:01:35,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:01:35,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:01:35,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:01:35,540 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_label02.c [2025-03-03 16:01:36,694 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9643cb03d/4b3603eedd66480b9c0d5a34ede2e130/FLAG7d5a2db53 [2025-03-03 16:01:37,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:01:37,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.c [2025-03-03 16:01:37,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9643cb03d/4b3603eedd66480b9c0d5a34ede2e130/FLAG7d5a2db53 [2025-03-03 16:01:37,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9643cb03d/4b3603eedd66480b9c0d5a34ede2e130 [2025-03-03 16:01:37,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:01:37,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:01:37,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:01:37,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:01:37,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:01:37,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:37" (1/1) ... [2025-03-03 16:01:37,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1781c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:37, skipping insertion in model container [2025-03-03 16:01:37,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:37" (1/1) ... [2025-03-03 16:01:37,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:01:37,654 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_label02.c[6354,6367] [2025-03-03 16:01:37,715 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_label02.c[13644,13657] [2025-03-03 16:01:38,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:01:38,151 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:01:38,177 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_label02.c[6354,6367] [2025-03-03 16:01:38,186 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_label02.c[13644,13657] [2025-03-03 16:01:38,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:01:38,457 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:01:38,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:38 WrapperNode [2025-03-03 16:01:38,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:01:38,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:01:38,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:01:38,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:01:38,464 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:38" (1/1) ... [2025-03-03 16:01:38,503 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:38" (1/1) ... [2025-03-03 16:01:38,734 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-03-03 16:01:38,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:01:38,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:01:38,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:01:38,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:01:38,742 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:38" (1/1) ... [2025-03-03 16:01:38,743 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:38" (1/1) ... [2025-03-03 16:01:38,778 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:38" (1/1) ... [2025-03-03 16:01:38,896 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:38,896 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:38" (1/1) ... [2025-03-03 16:01:38,896 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:38" (1/1) ... [2025-03-03 16:01:38,975 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:38" (1/1) ... [2025-03-03 16:01:38,992 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:38" (1/1) ... [2025-03-03 16:01:39,012 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:38" (1/1) ... [2025-03-03 16:01:39,027 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:38" (1/1) ... [2025-03-03 16:01:39,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:01:39,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:01:39,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:01:39,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:01:39,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:38" (1/1) ... [2025-03-03 16:01:39,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:01:39,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:39,141 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:39,147 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:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:01:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:01:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:01:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:01:39,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:01:39,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:01:42,505 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2025-03-03 16:01:42,505 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2025-03-03 16:01:42,505 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2025-03-03 16:01:42,634 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-03-03 16:01:42,635 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:01:42,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:01:42,663 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:01:42,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:01:42 BoogieIcfgContainer [2025-03-03 16:01:42,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:01:42,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:01:42,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:01:42,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:01:42,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:01:37" (1/3) ... [2025-03-03 16:01:42,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaf26ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:42, skipping insertion in model container [2025-03-03 16:01:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:38" (2/3) ... [2025-03-03 16:01:42,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaf26ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:42, skipping insertion in model container [2025-03-03 16:01:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:01:42" (3/3) ... [2025-03-03 16:01:42,673 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.c [2025-03-03 16:01:42,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:01:42,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:01:42,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:01:42,760 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;@6d5bc877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:01:42,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:01:42,766 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:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:01:42,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:42,770 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:42,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1636970803, now seen corresponding path program 1 times [2025-03-03 16:01:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662003066] [2025-03-03 16:01:42,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:42,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:01:42,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:01:42,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:42,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:42,923 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:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662003066] [2025-03-03 16:01:42,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662003066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:42,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:42,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:01:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712506229] [2025-03-03 16:01:42,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:01:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:42,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:01:42,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:01:42,946 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:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:43,008 INFO L93 Difference]: Finished difference Result 1720 states and 3268 transitions. [2025-03-03 16:01:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:01:43,010 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:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:43,020 INFO L225 Difference]: With dead ends: 1720 [2025-03-03 16:01:43,020 INFO L226 Difference]: Without dead ends: 806 [2025-03-03 16:01:43,025 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:43,027 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:43,027 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:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-03 16:01:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-03-03 16:01:43,084 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:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-03-03 16:01:43,094 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-03-03 16:01:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-03-03 16:01:43,095 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:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-03-03 16:01:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:01:43,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:43,096 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:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:01:43,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:43,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-03-03 16:01:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150307080] [2025-03-03 16:01:43,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:43,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:01:43,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:01:43,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:43,242 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:43,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:43,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150307080] [2025-03-03 16:01:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150307080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652327448] [2025-03-03 16:01:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:43,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:43,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:43,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:43,244 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:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:43,356 INFO L93 Difference]: Finished difference Result 870 states and 1622 transitions. [2025-03-03 16:01:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:43,359 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:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:43,362 INFO L225 Difference]: With dead ends: 870 [2025-03-03 16:01:43,365 INFO L226 Difference]: Without dead ends: 836 [2025-03-03 16:01:43,365 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:43,365 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.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:43,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-03 16:01:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 806. [2025-03-03 16:01:43,391 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:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-03-03 16:01:43,393 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-03-03 16:01:43,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:43,393 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-03-03 16:01:43,393 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:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-03-03 16:01:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 16:01:43,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:43,394 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:43,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:01:43,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-03-03 16:01:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995258724] [2025-03-03 16:01:43,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:43,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 16:01:43,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 16:01:43,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:43,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:43,546 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:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995258724] [2025-03-03 16:01:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995258724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:43,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:43,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012639523] [2025-03-03 16:01:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:43,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:43,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:43,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:43,547 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:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:43,679 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-03-03 16:01:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:01:43,681 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:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:43,687 INFO L225 Difference]: With dead ends: 986 [2025-03-03 16:01:43,687 INFO L226 Difference]: Without dead ends: 956 [2025-03-03 16:01:43,688 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:43,690 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:43,691 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:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-03 16:01:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-03-03 16:01:43,720 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:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-03-03 16:01:43,723 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-03-03 16:01:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:43,724 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-03-03 16:01:43,724 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:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-03-03 16:01:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:01:43,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:43,725 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:43,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:01:43,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:43,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-03-03 16:01:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:43,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568909090] [2025-03-03 16:01:43,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:43,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:01:43,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:01:43,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:43,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:43,813 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:43,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568909090] [2025-03-03 16:01:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568909090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:43,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492889027] [2025-03-03 16:01:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:43,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:43,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:43,815 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:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:43,839 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-03-03 16:01:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:43,840 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:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:43,844 INFO L225 Difference]: With dead ends: 939 [2025-03-03 16:01:43,845 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:01:43,845 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:43,846 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:43,847 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:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:01:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 16:01:43,869 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:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-03-03 16:01:43,872 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-03-03 16:01:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:43,873 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-03-03 16:01:43,873 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:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-03-03 16:01:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:01:43,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:43,876 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:43,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:01:43,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-03-03 16:01:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907401604] [2025-03-03 16:01:43,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:43,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:01:43,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:01:43,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:43,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:44,041 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:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907401604] [2025-03-03 16:01:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907401604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:44,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:44,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293167926] [2025-03-03 16:01:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:44,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:44,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:44,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:44,042 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:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:44,104 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-03-03 16:01:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:44,104 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:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:44,107 INFO L225 Difference]: With dead ends: 984 [2025-03-03 16:01:44,107 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:01:44,108 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:44,109 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:44,109 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:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:01:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 16:01:44,122 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:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-03-03 16:01:44,125 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-03-03 16:01:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:44,126 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-03-03 16:01:44,126 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:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-03-03 16:01:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 16:01:44,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:44,127 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:44,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:01:44,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-03-03 16:01:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009114691] [2025-03-03 16:01:44,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:44,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 16:01:44,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 16:01:44,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:44,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:44,308 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:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009114691] [2025-03-03 16:01:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009114691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:01:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022386884] [2025-03-03 16:01:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:44,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:01:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:44,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:01:44,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:44,309 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:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:44,371 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-03-03 16:01:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:01:44,372 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:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:44,375 INFO L225 Difference]: With dead ends: 887 [2025-03-03 16:01:44,375 INFO L226 Difference]: Without dead ends: 885 [2025-03-03 16:01:44,376 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:44,376 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:44,377 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:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-03 16:01:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-03-03 16:01:44,390 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:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-03-03 16:01:44,393 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-03-03 16:01:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:44,394 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-03-03 16:01:44,394 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:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-03-03 16:01:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:44,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:44,395 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:44,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:01:44,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-03-03 16:01:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101663291] [2025-03-03 16:01:44,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:44,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:44,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:44,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:44,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:44,447 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:44,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:44,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101663291] [2025-03-03 16:01:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101663291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:44,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634322110] [2025-03-03 16:01:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:44,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:44,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:44,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:44,449 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:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:44,473 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-03-03 16:01:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:44,474 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:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:44,478 INFO L225 Difference]: With dead ends: 1007 [2025-03-03 16:01:44,478 INFO L226 Difference]: Without dead ends: 943 [2025-03-03 16:01:44,479 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:44,479 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:44,480 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:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-03 16:01:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-03-03 16:01:44,495 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:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-03-03 16:01:44,499 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-03-03 16:01:44,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:44,499 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-03-03 16:01:44,499 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:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-03-03 16:01:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:44,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:44,500 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:44,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:01:44,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-03-03 16:01:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087200601] [2025-03-03 16:01:44,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:44,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:44,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:44,533 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:44,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087200601] [2025-03-03 16:01:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087200601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374421739] [2025-03-03 16:01:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:44,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:44,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:44,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:44,535 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:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:44,555 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-03-03 16:01:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:44,556 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:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:44,559 INFO L225 Difference]: With dead ends: 1243 [2025-03-03 16:01:44,560 INFO L226 Difference]: Without dead ends: 1080 [2025-03-03 16:01:44,560 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:44,561 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:44,561 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:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-03-03 16:01:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-03-03 16:01:44,578 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:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-03-03 16:01:44,582 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-03-03 16:01:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:44,582 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-03-03 16:01:44,582 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:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-03-03 16:01:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:44,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:44,583 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:44,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:01:44,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-03-03 16:01:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460591121] [2025-03-03 16:01:44,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:44,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:44,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:44,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:44,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:44,616 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:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460591121] [2025-03-03 16:01:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460591121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043543127] [2025-03-03 16:01:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:44,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:44,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:44,617 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:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:44,643 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-03-03 16:01:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:44,644 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:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:44,648 INFO L225 Difference]: With dead ends: 1630 [2025-03-03 16:01:44,649 INFO L226 Difference]: Without dead ends: 1330 [2025-03-03 16:01:44,649 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:44,651 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:44,651 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:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-03 16:01:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-03-03 16:01:44,676 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:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-03-03 16:01:44,684 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-03-03 16:01:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:44,684 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-03-03 16:01:44,684 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:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-03-03 16:01:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:44,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:44,685 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:44,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:01:44,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:44,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-03-03 16:01:44,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:44,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926501203] [2025-03-03 16:01:44,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:44,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:44,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:44,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:44,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:44,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:44,798 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:44,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926501203] [2025-03-03 16:01:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926501203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:44,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:44,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:44,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295709787] [2025-03-03 16:01:44,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:44,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:44,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:44,799 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:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:44,890 INFO L93 Difference]: Finished difference Result 2960 states and 4508 transitions. [2025-03-03 16:01:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:44,891 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:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:44,900 INFO L225 Difference]: With dead ends: 2960 [2025-03-03 16:01:44,900 INFO L226 Difference]: Without dead ends: 2558 [2025-03-03 16:01:44,901 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:44,902 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:44,902 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:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-03 16:01:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1804. [2025-03-03 16:01:44,939 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:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2888 transitions. [2025-03-03 16:01:44,945 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2888 transitions. Word has length 54 [2025-03-03 16:01:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:44,945 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2888 transitions. [2025-03-03 16:01:44,945 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:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2888 transitions. [2025-03-03 16:01:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:44,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:44,946 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:44,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:01:44,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-03-03 16:01:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151795515] [2025-03-03 16:01:44,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:44,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:44,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:44,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:44,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:45,027 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:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151795515] [2025-03-03 16:01:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151795515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142836464] [2025-03-03 16:01:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:45,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:45,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:45,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:45,029 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:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:45,137 INFO L93 Difference]: Finished difference Result 3508 states and 5268 transitions. [2025-03-03 16:01:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:45,137 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:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:45,145 INFO L225 Difference]: With dead ends: 3508 [2025-03-03 16:01:45,146 INFO L226 Difference]: Without dead ends: 2958 [2025-03-03 16:01:45,147 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:45,147 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:45,147 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:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-03-03 16:01:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2552. [2025-03-03 16:01:45,191 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:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3916 transitions. [2025-03-03 16:01:45,199 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3916 transitions. Word has length 54 [2025-03-03 16:01:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:45,199 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3916 transitions. [2025-03-03 16:01:45,199 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:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3916 transitions. [2025-03-03 16:01:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:45,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:45,200 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:45,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:01:45,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:45,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-03-03 16:01:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:45,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246639138] [2025-03-03 16:01:45,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:45,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:45,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:45,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:45,280 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:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246639138] [2025-03-03 16:01:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246639138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:45,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326306577] [2025-03-03 16:01:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:45,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:45,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:45,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:45,282 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:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:45,360 INFO L93 Difference]: Finished difference Result 4056 states and 6024 transitions. [2025-03-03 16:01:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:45,360 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:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:45,370 INFO L225 Difference]: With dead ends: 4056 [2025-03-03 16:01:45,370 INFO L226 Difference]: Without dead ends: 3506 [2025-03-03 16:01:45,372 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:45,372 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:45,373 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:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-03-03 16:01:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3100. [2025-03-03 16:01:45,426 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:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4672 transitions. [2025-03-03 16:01:45,435 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4672 transitions. Word has length 54 [2025-03-03 16:01:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:45,435 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4672 transitions. [2025-03-03 16:01:45,435 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:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4672 transitions. [2025-03-03 16:01:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 16:01:45,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:45,436 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:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:01:45,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-03-03 16:01:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608400823] [2025-03-03 16:01:45,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:45,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 16:01:45,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 16:01:45,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:45,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:45,505 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:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608400823] [2025-03-03 16:01:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608400823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:45,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:45,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:45,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443419589] [2025-03-03 16:01:45,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:45,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:45,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:45,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:45,507 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:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:45,550 INFO L93 Difference]: Finished difference Result 5424 states and 7882 transitions. [2025-03-03 16:01:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:45,551 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:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:45,562 INFO L225 Difference]: With dead ends: 5424 [2025-03-03 16:01:45,562 INFO L226 Difference]: Without dead ends: 3102 [2025-03-03 16:01:45,566 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:45,567 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:45,568 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:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-03-03 16:01:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3100. [2025-03-03 16:01:45,627 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:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4622 transitions. [2025-03-03 16:01:45,637 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4622 transitions. Word has length 55 [2025-03-03 16:01:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:45,638 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4622 transitions. [2025-03-03 16:01:45,638 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:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4622 transitions. [2025-03-03 16:01:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:01:45,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:45,639 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:45,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:01:45,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:45,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-03-03 16:01:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:45,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307993687] [2025-03-03 16:01:45,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:45,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:01:45,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:01:45,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:45,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:45,700 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:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307993687] [2025-03-03 16:01:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307993687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485237910] [2025-03-03 16:01:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:45,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:45,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:45,703 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:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:45,741 INFO L93 Difference]: Finished difference Result 4019 states and 5882 transitions. [2025-03-03 16:01:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:45,741 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:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:45,746 INFO L225 Difference]: With dead ends: 4019 [2025-03-03 16:01:45,746 INFO L226 Difference]: Without dead ends: 1697 [2025-03-03 16:01:45,749 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:45,749 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:45,749 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:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-03 16:01:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1689. [2025-03-03 16:01:45,775 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:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2697 transitions. [2025-03-03 16:01:45,781 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2697 transitions. Word has length 56 [2025-03-03 16:01:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:45,781 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2697 transitions. [2025-03-03 16:01:45,781 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:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2697 transitions. [2025-03-03 16:01:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:01:45,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:45,782 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:45,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:01:45,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:45,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-03-03 16:01:45,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:45,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480873667] [2025-03-03 16:01:45,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:45,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:01:45,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:01:45,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:45,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:45,844 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:45,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:45,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480873667] [2025-03-03 16:01:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480873667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:45,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:45,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:45,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324701738] [2025-03-03 16:01:45,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:45,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:45,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:45,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:45,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:45,846 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:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:45,873 INFO L93 Difference]: Finished difference Result 2143 states and 3311 transitions. [2025-03-03 16:01:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:45,874 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:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:45,879 INFO L225 Difference]: With dead ends: 2143 [2025-03-03 16:01:45,879 INFO L226 Difference]: Without dead ends: 1241 [2025-03-03 16:01:45,881 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:45,881 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:45,882 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:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-03 16:01:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-03 16:01:45,906 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:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2076 transitions. [2025-03-03 16:01:45,911 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2076 transitions. Word has length 57 [2025-03-03 16:01:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:45,912 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2076 transitions. [2025-03-03 16:01:45,912 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:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2076 transitions. [2025-03-03 16:01:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:01:45,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:45,913 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:45,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:01:45,913 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:45,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-03-03 16:01:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094787287] [2025-03-03 16:01:45,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:01:45,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:01:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:47,176 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:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094787287] [2025-03-03 16:01:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094787287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498983186] [2025-03-03 16:01:47,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:47,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:47,180 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:47,181 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:47,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:01:47,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:01:47,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:47,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:47,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 16:01:47,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:47,421 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:47,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:47,713 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:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498983186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:47,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-03-03 16:01:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793040693] [2025-03-03 16:01:47,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:47,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:01:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:47,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:01:47,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:01:47,715 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:01:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:49,767 INFO L93 Difference]: Finished difference Result 3409 states and 4899 transitions. [2025-03-03 16:01:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 16:01:49,767 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:01:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:49,774 INFO L225 Difference]: With dead ends: 3409 [2025-03-03 16:01:49,774 INFO L226 Difference]: Without dead ends: 2957 [2025-03-03 16:01:49,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 16:01:49,777 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 15300 mSDsluCounter, 6299 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:01:49,777 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:01:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2025-03-03 16:01:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2795. [2025-03-03 16:01:49,873 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:01:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 4015 transitions. [2025-03-03 16:01:49,879 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 4015 transitions. Word has length 59 [2025-03-03 16:01:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:49,879 INFO L471 AbstractCegarLoop]: Abstraction has 2795 states and 4015 transitions. [2025-03-03 16:01:49,880 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:01:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 4015 transitions. [2025-03-03 16:01:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:01:49,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:49,881 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:01:49,888 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:01:50,081 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:01:50,082 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:50,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-03-03 16:01:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187151858] [2025-03-03 16:01:50,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:50,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:50,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:50,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:50,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:50,343 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:01:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187151858] [2025-03-03 16:01:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187151858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087358724] [2025-03-03 16:01:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:50,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:50,345 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:01:50,347 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:01:50,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:50,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:50,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:50,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:50,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 16:01:50,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:51,336 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:01:51,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:52,292 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:01:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087358724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:52,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:52,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-03-03 16:01:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442966714] [2025-03-03 16:01:52,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:52,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 16:01:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:52,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 16:01:52,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2025-03-03 16:01:52,293 INFO L87 Difference]: Start difference. First operand 2795 states and 4015 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:01:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:53,488 INFO L93 Difference]: Finished difference Result 7897 states and 10512 transitions. [2025-03-03 16:01:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:01:53,489 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:01:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:53,500 INFO L225 Difference]: With dead ends: 7897 [2025-03-03 16:01:53,500 INFO L226 Difference]: Without dead ends: 6171 [2025-03-03 16:01:53,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=802, Invalid=2390, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 16:01:53,505 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 14048 mSDsluCounter, 7713 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14048 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:53,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14048 Valid, 9200 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:01:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2025-03-03 16:01:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 5957. [2025-03-03 16:01:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5957 states, 5955 states have (on average 1.32879932829555) internal successors, (7913), 5956 states have internal predecessors, (7913), 0 states have call successors, (0), 0 states 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:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 7913 transitions. [2025-03-03 16:01:53,648 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 7913 transitions. Word has length 60 [2025-03-03 16:01:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:53,649 INFO L471 AbstractCegarLoop]: Abstraction has 5957 states and 7913 transitions. [2025-03-03 16:01:53,649 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:01:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 7913 transitions. [2025-03-03 16:01:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:01:53,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:53,650 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:01:53,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:01:53,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 16:01:53,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:53,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1592793716, now seen corresponding path program 1 times [2025-03-03 16:01:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:53,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619554952] [2025-03-03 16:01:53,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:53,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:53,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:53,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:54,189 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:01:54,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619554952] [2025-03-03 16:01:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619554952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297618230] [2025-03-03 16:01:54,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:54,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:54,192 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:01:54,194 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:01:54,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:54,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:54,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:54,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:01:54,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:54,521 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:01:54,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:54,967 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:01:54,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297618230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:54,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:54,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:01:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698688019] [2025-03-03 16:01:54,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:54,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:01:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:01:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:01:54,969 INFO L87 Difference]: Start difference. First operand 5957 states and 7913 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:01:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:55,383 INFO L93 Difference]: Finished difference Result 10549 states and 13698 transitions. [2025-03-03 16:01:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:01:55,383 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:01:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:55,393 INFO L225 Difference]: With dead ends: 10549 [2025-03-03 16:01:55,393 INFO L226 Difference]: Without dead ends: 6201 [2025-03-03 16:01:55,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:01:55,399 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 13537 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13537 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:55,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13537 Valid, 4569 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:01:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6201 states. [2025-03-03 16:01:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6201 to 5941. [2025-03-03 16:01:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5941 states, 5939 states have (on average 1.3214345849469609) internal successors, (7848), 5940 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states 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,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 7848 transitions. [2025-03-03 16:01:55,538 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 7848 transitions. Word has length 60 [2025-03-03 16:01:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:55,538 INFO L471 AbstractCegarLoop]: Abstraction has 5941 states and 7848 transitions. [2025-03-03 16:01:55,538 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:01:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 7848 transitions. [2025-03-03 16:01:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:01:55,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:55,539 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:01:55,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:01:55,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:01:55,742 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:55,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash -506964052, now seen corresponding path program 1 times [2025-03-03 16:01:55,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:55,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007769212] [2025-03-03 16:01:55,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:55,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:55,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:55,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:55,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,029 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: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 [2007769212] [2025-03-03 16:01:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007769212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517295456] [2025-03-03 16:01:56,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:56,032 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:01:56,038 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:01:56,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:56,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:56,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:56,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:56,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:01:56,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:56,378 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:01:56,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:56,857 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:01:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517295456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:56,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:01:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133070989] [2025-03-03 16:01:56,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:56,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:01:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:56,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:01:56,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:01:56,858 INFO L87 Difference]: Start difference. First operand 5941 states and 7848 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:01:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:57,236 INFO L93 Difference]: Finished difference Result 15044 states and 19110 transitions. [2025-03-03 16:01:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:01:57,240 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:01:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:57,258 INFO L225 Difference]: With dead ends: 15044 [2025-03-03 16:01:57,258 INFO L226 Difference]: Without dead ends: 10506 [2025-03-03 16:01:57,264 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:01:57,265 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 10401 mSDsluCounter, 3216 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10401 SdHoareTripleChecker+Valid, 4709 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:57,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10401 Valid, 4709 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:01:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10506 states. [2025-03-03 16:01:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10506 to 10502. [2025-03-03 16:01:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10502 states, 10500 states have (on average 1.276) internal successors, (13398), 10501 states have internal predecessors, (13398), 0 states have call successors, (0), 0 states 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,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10502 states to 10502 states and 13398 transitions. [2025-03-03 16:01:57,550 INFO L78 Accepts]: Start accepts. Automaton has 10502 states and 13398 transitions. Word has length 60 [2025-03-03 16:01:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:57,550 INFO L471 AbstractCegarLoop]: Abstraction has 10502 states and 13398 transitions. [2025-03-03 16:01:57,551 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:01:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 10502 states and 13398 transitions. [2025-03-03 16:01:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:01:57,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:57,551 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:01:57,559 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:01:57,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:57,756 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:57,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:57,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991069, now seen corresponding path program 1 times [2025-03-03 16:01:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605181280] [2025-03-03 16:01:57,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:57,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:01:57,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:01:57,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:57,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:58,831 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:01:58,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605181280] [2025-03-03 16:01:58,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605181280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440457602] [2025-03-03 16:01:58,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:58,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:58,835 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:01:58,836 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:01:58,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:01:58,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:01:58,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:58,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:58,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 16:01:58,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:59,879 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:01:59,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:00,796 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:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440457602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:00,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2025-03-03 16:02:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864722364] [2025-03-03 16:02:00,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:00,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 16:02:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:00,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 16:02:00,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2060, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 16:02:00,798 INFO L87 Difference]: Start difference. First operand 10502 states and 13398 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:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:19,861 INFO L93 Difference]: Finished difference Result 24316 states and 30413 transitions. [2025-03-03 16:02:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-03-03 16:02:19,862 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:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:19,889 INFO L225 Difference]: With dead ends: 24316 [2025-03-03 16:02:19,889 INFO L226 Difference]: Without dead ends: 19258 [2025-03-03 16:02:19,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12774 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=7312, Invalid=27844, Unknown=0, NotChecked=0, Total=35156 [2025-03-03 16:02:19,901 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 25139 mSDsluCounter, 23967 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25139 SdHoareTripleChecker+Valid, 25516 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:19,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25139 Valid, 25516 Invalid, 2576 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [259 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 16:02:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19258 states. [2025-03-03 16:02:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19258 to 10925. [2025-03-03 16:02:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10925 states, 10923 states have (on average 1.269339924929049) internal successors, (13865), 10924 states have internal predecessors, (13865), 0 states have call successors, (0), 0 states 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:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 13865 transitions. [2025-03-03 16:02:20,319 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 13865 transitions. Word has length 61 [2025-03-03 16:02:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:20,320 INFO L471 AbstractCegarLoop]: Abstraction has 10925 states and 13865 transitions. [2025-03-03 16:02:20,320 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:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 13865 transitions. [2025-03-03 16:02:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:02:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:20,321 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:20,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 16:02:20,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:20,523 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:20,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1245500193, now seen corresponding path program 1 times [2025-03-03 16:02:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353210112] [2025-03-03 16:02:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:20,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:20,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:20,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:20,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:21,265 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:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353210112] [2025-03-03 16:02:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353210112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084593574] [2025-03-03 16:02:21,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:21,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:21,269 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:21,270 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:21,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:02:21,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:02:21,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:21,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:21,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:02:21,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:21,824 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:21,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:22,275 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:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084593574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:22,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:22,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 29 [2025-03-03 16:02:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195797911] [2025-03-03 16:02:22,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:22,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 16:02:22,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:22,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 16:02:22,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-03-03 16:02:22,277 INFO L87 Difference]: Start difference. First operand 10925 states and 13865 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:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:23,466 INFO L93 Difference]: Finished difference Result 15352 states and 19299 transitions. [2025-03-03 16:02:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 16:02:23,467 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:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:23,483 INFO L225 Difference]: With dead ends: 15352 [2025-03-03 16:02:23,483 INFO L226 Difference]: Without dead ends: 10641 [2025-03-03 16:02:23,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 16:02:23,490 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 10999 mSDsluCounter, 12117 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10999 SdHoareTripleChecker+Valid, 13612 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:23,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10999 Valid, 13612 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:02:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10641 states. [2025-03-03 16:02:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10641 to 9060. [2025-03-03 16:02:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9060 states, 9058 states have (on average 1.2780967100905276) internal successors, (11577), 9059 states have internal predecessors, (11577), 0 states have call successors, (0), 0 states 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:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9060 states to 9060 states and 11577 transitions. [2025-03-03 16:02:23,850 INFO L78 Accepts]: Start accepts. Automaton has 9060 states and 11577 transitions. Word has length 61 [2025-03-03 16:02:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:23,850 INFO L471 AbstractCegarLoop]: Abstraction has 9060 states and 11577 transitions. [2025-03-03 16:02:23,850 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:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 9060 states and 11577 transitions. [2025-03-03 16:02:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 16:02:23,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:23,852 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:23,864 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:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:24,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1435836916, now seen corresponding path program 1 times [2025-03-03 16:02:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929502477] [2025-03-03 16:02:24,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:02:24,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:02:24,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:24,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:24,934 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:24,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929502477] [2025-03-03 16:02:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929502477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180128581] [2025-03-03 16:02:24,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:24,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:24,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:24,937 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:24,939 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:24,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:02:25,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:02:25,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:25,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 16:02:25,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:26,625 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:26,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:28,907 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:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180128581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:28,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 17] total 57 [2025-03-03 16:02:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245384969] [2025-03-03 16:02:28,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 16:02:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:28,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 16:02:28,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2841, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 16:02:28,909 INFO L87 Difference]: Start difference. First operand 9060 states and 11577 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:02:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:55,059 INFO L93 Difference]: Finished difference Result 21412 states and 26748 transitions. [2025-03-03 16:02:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2025-03-03 16:02:55,060 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:02:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:55,081 INFO L225 Difference]: With dead ends: 21412 [2025-03-03 16:02:55,081 INFO L226 Difference]: Without dead ends: 19560 [2025-03-03 16:02:55,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12748 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=6385, Invalid=30287, Unknown=0, NotChecked=0, Total=36672 [2025-03-03 16:02:55,090 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 30911 mSDsluCounter, 24462 mSDsCounter, 0 mSdLazyCounter, 3353 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30911 SdHoareTripleChecker+Valid, 26014 SdHoareTripleChecker+Invalid, 3511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 3353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:55,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30911 Valid, 26014 Invalid, 3511 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [158 Valid, 3353 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:02:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19560 states. [2025-03-03 16:02:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19560 to 9404. [2025-03-03 16:02:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9404 states, 9402 states have (on average 1.2752605828547117) internal successors, (11990), 9403 states have internal predecessors, (11990), 0 states have call successors, (0), 0 states 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:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9404 states to 9404 states and 11990 transitions. [2025-03-03 16:02:55,469 INFO L78 Accepts]: Start accepts. Automaton has 9404 states and 11990 transitions. Word has length 62 [2025-03-03 16:02:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 9404 states and 11990 transitions. [2025-03-03 16:02:55,469 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:02:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9404 states and 11990 transitions. [2025-03-03 16:02:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:02:55,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:55,470 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, 1, 1, 1] [2025-03-03 16:02:55,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 16:02:55,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:55,671 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:55,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1333758369, now seen corresponding path program 1 times [2025-03-03 16:02:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309245649] [2025-03-03 16:02:55,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:55,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:02:55,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:02:55,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:55,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:55,735 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:55,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:55,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309245649] [2025-03-03 16:02:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309245649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:02:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:02:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:02:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827477241] [2025-03-03 16:02:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:02:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:02:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:55,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:02:55,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:02:55,737 INFO L87 Difference]: Start difference. First operand 9404 states and 11990 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:03:00,025 INFO L93 Difference]: Finished difference Result 11659 states and 16299 transitions. [2025-03-03 16:03:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:03:00,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:03:00,038 INFO L225 Difference]: With dead ends: 11659 [2025-03-03 16:03:00,038 INFO L226 Difference]: Without dead ends: 10906 [2025-03-03 16:03:00,040 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:03:00,040 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 2331 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:03:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 780 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 16:03:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10906 states. [2025-03-03 16:03:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10906 to 10906. [2025-03-03 16:03:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10906 states, 10904 states have (on average 1.2808143800440206) internal successors, (13966), 10905 states have internal predecessors, (13966), 0 states have call successors, (0), 0 states 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:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10906 states to 10906 states and 13966 transitions. [2025-03-03 16:03:00,399 INFO L78 Accepts]: Start accepts. Automaton has 10906 states and 13966 transitions. Word has length 63 [2025-03-03 16:03:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:03:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 10906 states and 13966 transitions. [2025-03-03 16:03:00,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10906 states and 13966 transitions. [2025-03-03 16:03:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:03:00,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:03:00,400 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:00,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:03:00,400 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:03:00,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:03:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1042667455, now seen corresponding path program 1 times [2025-03-03 16:03:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:03:00,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378031635] [2025-03-03 16:03:00,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:03:00,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:03:00,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:03:00,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:00,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:00,746 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:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:03:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378031635] [2025-03-03 16:03:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378031635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:03:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324845312] [2025-03-03 16:03:00,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:03:00,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:03:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:03:00,749 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:00,751 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:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:03:00,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:03:00,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:03:00,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:03:00,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 16:03:00,844 INFO L279 TraceCheckSpWp]: Computing forward predicates...