./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.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 4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:20:29,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:20:29,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:20:29,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:20:29,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:20:29,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:20:29,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:20:29,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:20:29,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:20:29,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:20:29,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:20:29,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:20:29,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:20:29,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:20:29,777 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:20:29,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:20:29,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:20:29,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:20:29,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:20:29,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:20:29,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:20:29,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:20:29,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:20:29,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:20:29,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:20:29,780 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 -> 4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4 [2025-03-16 20:20:30,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:20:30,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:20:30,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:20:30,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:20:30,020 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:20:30,020 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_label06.c [2025-03-16 20:20:31,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f382487/c87fe69eace24cd9908f76cc28c484e9/FLAG905b5c789 [2025-03-16 20:20:31,522 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:20:31,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2025-03-16 20:20:31,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f382487/c87fe69eace24cd9908f76cc28c484e9/FLAG905b5c789 [2025-03-16 20:20:31,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f382487/c87fe69eace24cd9908f76cc28c484e9 [2025-03-16 20:20:31,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:20:31,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:20:31,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:20:31,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:20:31,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:20:31,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:20:31" (1/1) ... [2025-03-16 20:20:31,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb6e55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:31, skipping insertion in model container [2025-03-16 20:20:31,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:20:31" (1/1) ... [2025-03-16 20:20:31,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:20:32,028 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_label06.c[6354,6367] [2025-03-16 20:20:32,062 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_label06.c[9171,9184] [2025-03-16 20:20:32,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:20:32,467 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:20:32,494 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_label06.c[6354,6367] [2025-03-16 20:20:32,499 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_label06.c[9171,9184] [2025-03-16 20:20:32,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:20:32,755 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:20:32,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32 WrapperNode [2025-03-16 20:20:32,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:20:32,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:20:32,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:20:32,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:20:32,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:32,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,010 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-03-16 20:20:33,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:20:33,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:20:33,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:20:33,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:20:33,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,161 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:20:33,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:20:33,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:20:33,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:20:33,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:20:33,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (1/1) ... [2025-03-16 20:20:33,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:20:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:33,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:20:33,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:20:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:20:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:20:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:20:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:20:33,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:20:33,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:20:36,809 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2025-03-16 20:20:36,809 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2025-03-16 20:20:36,810 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2025-03-16 20:20:36,925 INFO L? ?]: Removed 729 outVars from TransFormulas that were not future-live. [2025-03-16 20:20:36,925 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:20:36,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:20:36,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:20:36,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:20:36 BoogieIcfgContainer [2025-03-16 20:20:36,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:20:36,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:20:36,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:20:36,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:20:36,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:20:31" (1/3) ... [2025-03-16 20:20:36,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e456bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:20:36, skipping insertion in model container [2025-03-16 20:20:36,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:20:32" (2/3) ... [2025-03-16 20:20:36,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e456bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:20:36, skipping insertion in model container [2025-03-16 20:20:36,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:20:36" (3/3) ... [2025-03-16 20:20:36,965 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2025-03-16 20:20:36,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:20:36,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c that has 1 procedures, 807 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:20:37,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:20:37,061 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;@3e6c988e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:20:37,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:20:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:20:37,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:37,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:37,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:37,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash 768302087, now seen corresponding path program 1 times [2025-03-16 20:20:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633220026] [2025-03-16 20:20:37,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:37,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:20:37,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:20:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:37,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:37,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633220026] [2025-03-16 20:20:37,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633220026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:37,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:37,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:20:37,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046705971] [2025-03-16 20:20:37,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:37,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:20:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:37,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:20:37,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:20:37,270 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:37,337 INFO L93 Difference]: Finished difference Result 1594 states and 3142 transitions. [2025-03-16 20:20:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:20:37,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:20:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:37,350 INFO L225 Difference]: With dead ends: 1594 [2025-03-16 20:20:37,350 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 20:20:37,360 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-16 20:20:37,363 INFO L435 NwaCegarLoop]: 1526 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, 1526 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-16 20:20:37,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 20:20:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 20:20:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2025-03-16 20:20:37,431 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2025-03-16 20:20:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:37,431 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2025-03-16 20:20:37,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2025-03-16 20:20:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:20:37,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:37,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:37,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:20:37,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 474899080, now seen corresponding path program 1 times [2025-03-16 20:20:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891698856] [2025-03-16 20:20:37,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:37,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:20:37,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:20:37,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891698856] [2025-03-16 20:20:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891698856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:37,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:20:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054499940] [2025-03-16 20:20:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:37,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:20:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:37,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:20:37,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:37,585 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:37,666 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2025-03-16 20:20:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:20:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:20:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:37,671 INFO L225 Difference]: With dead ends: 864 [2025-03-16 20:20:37,671 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:20:37,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:20:37,672 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 45 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:37,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4533 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:20:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2025-03-16 20:20:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2025-03-16 20:20:37,695 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2025-03-16 20:20:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:37,695 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2025-03-16 20:20:37,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2025-03-16 20:20:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:20:37,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:37,697 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] [2025-03-16 20:20:37,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:20:37,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:37,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -360512326, now seen corresponding path program 1 times [2025-03-16 20:20:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:37,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351448059] [2025-03-16 20:20:37,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:37,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:37,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:20:37,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:20:37,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:37,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351448059] [2025-03-16 20:20:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351448059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:20:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879517557] [2025-03-16 20:20:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:37,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:37,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:37,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:37,835 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:40,471 INFO L93 Difference]: Finished difference Result 2307 states and 4378 transitions. [2025-03-16 20:20:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:20:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:40,478 INFO L225 Difference]: With dead ends: 2307 [2025-03-16 20:20:40,478 INFO L226 Difference]: Without dead ends: 1554 [2025-03-16 20:20:40,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:40,481 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 861 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:40,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 494 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 20:20:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-16 20:20:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-16 20:20:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1552 states have (on average 1.6314432989690721) internal successors, (2532), 1553 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2532 transitions. [2025-03-16 20:20:40,507 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2532 transitions. Word has length 23 [2025-03-16 20:20:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:40,507 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2532 transitions. [2025-03-16 20:20:40,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2532 transitions. [2025-03-16 20:20:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:20:40,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:40,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:40,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:20:40,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:40,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1346779243, now seen corresponding path program 1 times [2025-03-16 20:20:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664491671] [2025-03-16 20:20:40,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:40,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:20:40,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:20:40,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:40,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:40,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664491671] [2025-03-16 20:20:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664491671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:40,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518227732] [2025-03-16 20:20:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:40,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:40,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:40,624 INFO L87 Difference]: Start difference. First operand 1554 states and 2532 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:40,700 INFO L93 Difference]: Finished difference Result 1728 states and 2808 transitions. [2025-03-16 20:20:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:20:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 20:20:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:40,705 INFO L225 Difference]: With dead ends: 1728 [2025-03-16 20:20:40,705 INFO L226 Difference]: Without dead ends: 1699 [2025-03-16 20:20:40,706 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-16 20:20:40,706 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 4611 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:40,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1759 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-16 20:20:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1581. [2025-03-16 20:20:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.630778974034199) internal successors, (2575), 1580 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2575 transitions. [2025-03-16 20:20:40,730 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2575 transitions. Word has length 32 [2025-03-16 20:20:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2575 transitions. [2025-03-16 20:20:40,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2575 transitions. [2025-03-16 20:20:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:20:40,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:40,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:40,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:20:40,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:40,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1506878637, now seen corresponding path program 1 times [2025-03-16 20:20:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:40,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500212637] [2025-03-16 20:20:40,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:40,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:40,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:20:40,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:20:40,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:40,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:40,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:40,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500212637] [2025-03-16 20:20:40,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500212637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:40,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:40,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600891156] [2025-03-16 20:20:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:40,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:40,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:40,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:40,866 INFO L87 Difference]: Start difference. First operand 1581 states and 2575 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:40,913 INFO L93 Difference]: Finished difference Result 1639 states and 2665 transitions. [2025-03-16 20:20:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 20:20:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:40,919 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 20:20:40,919 INFO L226 Difference]: Without dead ends: 1583 [2025-03-16 20:20:40,919 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-16 20:20:40,920 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 1473 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1626 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-16 20:20:40,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1626 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-16 20:20:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1581. [2025-03-16 20:20:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 1.6301456618112729) internal successors, (2574), 1580 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2574 transitions. [2025-03-16 20:20:40,943 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2574 transitions. Word has length 34 [2025-03-16 20:20:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2574 transitions. [2025-03-16 20:20:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2574 transitions. [2025-03-16 20:20:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:20:40,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:40,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:40,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:20:40,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:40,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1505835952, now seen corresponding path program 1 times [2025-03-16 20:20:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624519624] [2025-03-16 20:20:40,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:40,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:20:40,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:20:40,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:40,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624519624] [2025-03-16 20:20:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624519624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:41,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997318383] [2025-03-16 20:20:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:41,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:41,014 INFO L87 Difference]: Start difference. First operand 1581 states and 2574 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:41,037 INFO L93 Difference]: Finished difference Result 1682 states and 2731 transitions. [2025-03-16 20:20:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:41,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 20:20:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:41,042 INFO L225 Difference]: With dead ends: 1682 [2025-03-16 20:20:41,042 INFO L226 Difference]: Without dead ends: 1626 [2025-03-16 20:20:41,043 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-16 20:20:41,043 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 1464 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1543 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-16 20:20:41,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-03-16 20:20:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1624. [2025-03-16 20:20:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.6270036991368682) internal successors, (2639), 1623 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2639 transitions. [2025-03-16 20:20:41,067 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2639 transitions. Word has length 34 [2025-03-16 20:20:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,067 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2639 transitions. [2025-03-16 20:20:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2639 transitions. [2025-03-16 20:20:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:20:41,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,068 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-16 20:20:41,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:20:41,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -530417449, now seen corresponding path program 1 times [2025-03-16 20:20:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542189488] [2025-03-16 20:20:41,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:20:41,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:20:41,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,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-16 20:20:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542189488] [2025-03-16 20:20:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542189488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:20:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177687567] [2025-03-16 20:20:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:20:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:20:41,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:20:41,244 INFO L87 Difference]: Start difference. First operand 1624 states and 2639 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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-16 20:20:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:41,284 INFO L93 Difference]: Finished difference Result 1630 states and 2646 transitions. [2025-03-16 20:20:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:20:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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-16 20:20:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:41,294 INFO L225 Difference]: With dead ends: 1630 [2025-03-16 20:20:41,294 INFO L226 Difference]: Without dead ends: 1628 [2025-03-16 20:20:41,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:20:41,295 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 5990 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7491 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:41,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7491 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-16 20:20:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2025-03-16 20:20:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1626 states have (on average 1.6248462484624846) internal successors, (2642), 1627 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2642 transitions. [2025-03-16 20:20:41,324 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2642 transitions. Word has length 35 [2025-03-16 20:20:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,325 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2642 transitions. [2025-03-16 20:20:41,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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-16 20:20:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2642 transitions. [2025-03-16 20:20:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:41,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,326 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] [2025-03-16 20:20:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:20:41,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1988236593, now seen corresponding path program 1 times [2025-03-16 20:20:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269529452] [2025-03-16 20:20:41,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:41,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:41,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269529452] [2025-03-16 20:20:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269529452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857559943] [2025-03-16 20:20:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:41,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:41,360 INFO L87 Difference]: Start difference. First operand 1628 states and 2642 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:41,375 INFO L93 Difference]: Finished difference Result 1818 states and 2926 transitions. [2025-03-16 20:20:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:41,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:41,381 INFO L225 Difference]: With dead ends: 1818 [2025-03-16 20:20:41,381 INFO L226 Difference]: Without dead ends: 1715 [2025-03-16 20:20:41,381 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-16 20:20:41,382 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1581 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-16 20:20:41,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-16 20:20:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1713. [2025-03-16 20:20:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1711 states have (on average 1.6160140268848626) internal successors, (2765), 1712 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2765 transitions. [2025-03-16 20:20:41,408 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2765 transitions. Word has length 36 [2025-03-16 20:20:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,409 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2765 transitions. [2025-03-16 20:20:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2765 transitions. [2025-03-16 20:20:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:41,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,411 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] [2025-03-16 20:20:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:20:41,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1756941775, now seen corresponding path program 1 times [2025-03-16 20:20:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367306797] [2025-03-16 20:20:41,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:41,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367306797] [2025-03-16 20:20:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367306797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803444515] [2025-03-16 20:20:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:41,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:41,452 INFO L87 Difference]: Start difference. First operand 1713 states and 2765 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:41,478 INFO L93 Difference]: Finished difference Result 2057 states and 3267 transitions. [2025-03-16 20:20:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:41,485 INFO L225 Difference]: With dead ends: 2057 [2025-03-16 20:20:41,485 INFO L226 Difference]: Without dead ends: 1869 [2025-03-16 20:20:41,486 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-16 20:20:41,487 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1470 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1583 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-16 20:20:41,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-03-16 20:20:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1867. [2025-03-16 20:20:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1865 states have (on average 1.597319034852547) internal successors, (2979), 1866 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2979 transitions. [2025-03-16 20:20:41,514 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2979 transitions. Word has length 36 [2025-03-16 20:20:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,514 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2979 transitions. [2025-03-16 20:20:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2979 transitions. [2025-03-16 20:20:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:20:41,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,515 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] [2025-03-16 20:20:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:20:41,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1922054193, now seen corresponding path program 1 times [2025-03-16 20:20:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352484312] [2025-03-16 20:20:41,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:20:41,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:20:41,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352484312] [2025-03-16 20:20:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352484312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902255361] [2025-03-16 20:20:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:41,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:41,548 INFO L87 Difference]: Start difference. First operand 1867 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:41,566 INFO L93 Difference]: Finished difference Result 2241 states and 3528 transitions. [2025-03-16 20:20:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:41,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:20:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:41,572 INFO L225 Difference]: With dead ends: 2241 [2025-03-16 20:20:41,572 INFO L226 Difference]: Without dead ends: 2039 [2025-03-16 20:20:41,573 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-16 20:20:41,573 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1474 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1583 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-16 20:20:41,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2025-03-16 20:20:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2025-03-16 20:20:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2035 states have (on average 1.5808353808353808) internal successors, (3217), 2036 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3217 transitions. [2025-03-16 20:20:41,601 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3217 transitions. Word has length 36 [2025-03-16 20:20:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,601 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3217 transitions. [2025-03-16 20:20:41,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3217 transitions. [2025-03-16 20:20:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:20:41,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,602 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] [2025-03-16 20:20:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:20:41,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 512007547, now seen corresponding path program 1 times [2025-03-16 20:20:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345536431] [2025-03-16 20:20:41,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:20:41,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:20:41,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:20:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345536431] [2025-03-16 20:20:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345536431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358042693] [2025-03-16 20:20:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:41,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:41,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:41,692 INFO L87 Difference]: Start difference. First operand 2037 states and 3217 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:41,758 INFO L93 Difference]: Finished difference Result 3685 states and 5561 transitions. [2025-03-16 20:20:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 50 [2025-03-16 20:20:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:41,768 INFO L225 Difference]: With dead ends: 3685 [2025-03-16 20:20:41,769 INFO L226 Difference]: Without dead ends: 3175 [2025-03-16 20:20:41,770 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-16 20:20:41,771 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 3033 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:41,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3145 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-03-16 20:20:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2545. [2025-03-16 20:20:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.546598505701927) internal successors, (3933), 2544 states have internal predecessors, (3933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3933 transitions. [2025-03-16 20:20:41,816 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3933 transitions. Word has length 50 [2025-03-16 20:20:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:41,817 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3933 transitions. [2025-03-16 20:20:41,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3933 transitions. [2025-03-16 20:20:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:20:41,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:41,819 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] [2025-03-16 20:20:41,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:20:41,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:41,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash -37781381, now seen corresponding path program 1 times [2025-03-16 20:20:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285104263] [2025-03-16 20:20:41,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:41,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:20:41,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:20:41,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:41,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:20:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285104263] [2025-03-16 20:20:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285104263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498915219] [2025-03-16 20:20:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:42,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:42,026 INFO L87 Difference]: Start difference. First operand 2545 states and 3933 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,185 INFO L93 Difference]: Finished difference Result 4193 states and 6277 transitions. [2025-03-16 20:20:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2025-03-16 20:20:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,196 INFO L225 Difference]: With dead ends: 4193 [2025-03-16 20:20:42,196 INFO L226 Difference]: Without dead ends: 3683 [2025-03-16 20:20:42,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:20:42,199 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 3039 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:42,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3139 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:20:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2025-03-16 20:20:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3309. [2025-03-16 20:20:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 3307 states have (on average 1.511037193831267) internal successors, (4997), 3308 states have internal predecessors, (4997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4997 transitions. [2025-03-16 20:20:42,272 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4997 transitions. Word has length 50 [2025-03-16 20:20:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,272 INFO L471 AbstractCegarLoop]: Abstraction has 3309 states and 4997 transitions. [2025-03-16 20:20:42,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4997 transitions. [2025-03-16 20:20:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:20:42,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,273 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] [2025-03-16 20:20:42,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:20:42,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 578189947, now seen corresponding path program 1 times [2025-03-16 20:20:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450412808] [2025-03-16 20:20:42,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:20:42,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:20:42,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450412808] [2025-03-16 20:20:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450412808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:20:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52686710] [2025-03-16 20:20:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:20:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:20:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:20:42,340 INFO L87 Difference]: Start difference. First operand 3309 states and 4997 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-16 20:20:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,414 INFO L93 Difference]: Finished difference Result 4421 states and 6609 transitions. [2025-03-16 20:20:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:20:42,415 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 50 [2025-03-16 20:20:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,425 INFO L225 Difference]: With dead ends: 4421 [2025-03-16 20:20:42,425 INFO L226 Difference]: Without dead ends: 4051 [2025-03-16 20:20:42,427 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-16 20:20:42,427 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 3032 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3032 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:42,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3032 Valid, 3155 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2025-03-16 20:20:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3677. [2025-03-16 20:20:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5034013605442176) internal successors, (5525), 3676 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5525 transitions. [2025-03-16 20:20:42,490 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5525 transitions. Word has length 50 [2025-03-16 20:20:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,490 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5525 transitions. [2025-03-16 20:20:42,490 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-16 20:20:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5525 transitions. [2025-03-16 20:20:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:20:42,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,491 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] [2025-03-16 20:20:42,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:20:42,491 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1763746431, now seen corresponding path program 1 times [2025-03-16 20:20:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647433392] [2025-03-16 20:20:42,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:20:42,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:20:42,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:42,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647433392] [2025-03-16 20:20:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647433392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698077460] [2025-03-16 20:20:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:42,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:42,546 INFO L87 Difference]: Start difference. First operand 3677 states and 5525 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-16 20:20:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,626 INFO L93 Difference]: Finished difference Result 5829 states and 8563 transitions. [2025-03-16 20:20:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:42,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 51 [2025-03-16 20:20:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,633 INFO L225 Difference]: With dead ends: 5829 [2025-03-16 20:20:42,634 INFO L226 Difference]: Without dead ends: 3679 [2025-03-16 20:20:42,636 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-16 20:20:42,636 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 29 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 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-16 20:20:42,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2025-03-16 20:20:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3677. [2025-03-16 20:20:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.489795918367347) internal successors, (5475), 3676 states have internal predecessors, (5475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5475 transitions. [2025-03-16 20:20:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5475 transitions. Word has length 51 [2025-03-16 20:20:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5475 transitions. [2025-03-16 20:20:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-16 20:20:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5475 transitions. [2025-03-16 20:20:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:20:42,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,699 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] [2025-03-16 20:20:42,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:20:42,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1844804163, now seen corresponding path program 1 times [2025-03-16 20:20:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830722331] [2025-03-16 20:20:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:20:42,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:20:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:42,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830722331] [2025-03-16 20:20:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830722331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415056583] [2025-03-16 20:20:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:42,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:42,751 INFO L87 Difference]: Start difference. First operand 3677 states and 5475 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,774 INFO L93 Difference]: Finished difference Result 4523 states and 6662 transitions. [2025-03-16 20:20:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 20:20:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,778 INFO L225 Difference]: With dead ends: 4523 [2025-03-16 20:20:42,778 INFO L226 Difference]: Without dead ends: 2373 [2025-03-16 20:20:42,780 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-16 20:20:42,781 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 23 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3013 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-16 20:20:42,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3013 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-16 20:20:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2366. [2025-03-16 20:20:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.5439932318104908) internal successors, (3650), 2365 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3650 transitions. [2025-03-16 20:20:42,811 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3650 transitions. Word has length 52 [2025-03-16 20:20:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,811 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3650 transitions. [2025-03-16 20:20:42,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3650 transitions. [2025-03-16 20:20:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:20:42,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,812 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] [2025-03-16 20:20:42,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:20:42,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 120675386, now seen corresponding path program 1 times [2025-03-16 20:20:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820848773] [2025-03-16 20:20:42,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:20:42,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:20:42,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820848773] [2025-03-16 20:20:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820848773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:20:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:20:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:20:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329296272] [2025-03-16 20:20:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:20:42,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:20:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:42,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:20:42,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:20:42,864 INFO L87 Difference]: Start difference. First operand 2366 states and 3650 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 20:20:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:42,880 INFO L93 Difference]: Finished difference Result 2784 states and 4228 transitions. [2025-03-16 20:20:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:20:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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 53 [2025-03-16 20:20:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:42,884 INFO L225 Difference]: With dead ends: 2784 [2025-03-16 20:20:42,884 INFO L226 Difference]: Without dead ends: 1954 [2025-03-16 20:20:42,885 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-16 20:20:42,886 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 25 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2992 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-16 20:20:42,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2992 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:20:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-03-16 20:20:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2025-03-16 20:20:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1950 states have (on average 1.5717948717948718) internal successors, (3065), 1951 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3065 transitions. [2025-03-16 20:20:42,910 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3065 transitions. Word has length 53 [2025-03-16 20:20:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 3065 transitions. [2025-03-16 20:20:42,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-16 20:20:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3065 transitions. [2025-03-16 20:20:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:20:42,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:42,911 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] [2025-03-16 20:20:42,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:20:42,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:42,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 637021683, now seen corresponding path program 1 times [2025-03-16 20:20:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788987746] [2025-03-16 20:20:42,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:42,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:20:42,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:20:42,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:42,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788987746] [2025-03-16 20:20:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788987746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140002989] [2025-03-16 20:20:43,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:43,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:43,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:20:43,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:20:43,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:20:43,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:20:43,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:43,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:43,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 20:20:43,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:43,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:20:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140002989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:43,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2025-03-16 20:20:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259194857] [2025-03-16 20:20:43,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 20:20:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:43,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 20:20:43,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:20:43,698 INFO L87 Difference]: Start difference. First operand 1952 states and 3065 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:44,645 INFO L93 Difference]: Finished difference Result 3823 states and 5549 transitions. [2025-03-16 20:20:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 20:20:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 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-16 20:20:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:44,650 INFO L225 Difference]: With dead ends: 3823 [2025-03-16 20:20:44,651 INFO L226 Difference]: Without dead ends: 3407 [2025-03-16 20:20:44,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 20:20:44,653 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 13741 mSDsluCounter, 4721 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13741 SdHoareTripleChecker+Valid, 6217 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:44,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13741 Valid, 6217 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:20:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2025-03-16 20:20:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3305. [2025-03-16 20:20:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3303 states have (on average 1.44141689373297) internal successors, (4761), 3304 states have internal predecessors, (4761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4761 transitions. [2025-03-16 20:20:44,701 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4761 transitions. Word has length 55 [2025-03-16 20:20:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:44,701 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4761 transitions. [2025-03-16 20:20:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4761 transitions. [2025-03-16 20:20:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:20:44,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:44,702 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:20:44,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:20:44,906 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,SelfDestructingSolverStorable16 [2025-03-16 20:20:44,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:44,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1237352262, now seen corresponding path program 1 times [2025-03-16 20:20:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417289642] [2025-03-16 20:20:44,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:44,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:20:44,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:20:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417289642] [2025-03-16 20:20:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417289642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282677586] [2025-03-16 20:20:45,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:45,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:20:45,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:20:45,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:20:45,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:20:45,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:45,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:45,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 20:20:45,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:45,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282677586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:46,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-16 20:20:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978285148] [2025-03-16 20:20:46,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:46,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:20:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:46,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:20:46,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:20:46,441 INFO L87 Difference]: Start difference. First operand 3305 states and 4761 transitions. Second operand has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:48,062 INFO L93 Difference]: Finished difference Result 7300 states and 9906 transitions. [2025-03-16 20:20:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 20:20:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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-16 20:20:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:48,073 INFO L225 Difference]: With dead ends: 7300 [2025-03-16 20:20:48,073 INFO L226 Difference]: Without dead ends: 5551 [2025-03-16 20:20:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=650, Invalid=2656, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 20:20:48,078 INFO L435 NwaCegarLoop]: 1489 mSDtfsCounter, 15624 mSDsluCounter, 15048 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15624 SdHoareTripleChecker+Valid, 16537 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:48,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15624 Valid, 16537 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:20:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2025-03-16 20:20:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 5541. [2025-03-16 20:20:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5539 states have (on average 1.3504242643076367) internal successors, (7480), 5540 states have internal predecessors, (7480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7480 transitions. [2025-03-16 20:20:48,181 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7480 transitions. Word has length 56 [2025-03-16 20:20:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:48,181 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 7480 transitions. [2025-03-16 20:20:48,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7480 transitions. [2025-03-16 20:20:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:20:48,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:48,183 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:20:48,191 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-16 20:20:48,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:20:48,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:48,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 155340792, now seen corresponding path program 1 times [2025-03-16 20:20:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:48,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951191195] [2025-03-16 20:20:48,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:48,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:48,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:20:48,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:20:48,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:48,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951191195] [2025-03-16 20:20:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951191195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617570476] [2025-03-16 20:20:48,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:48,976 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-16 20:20:48,978 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-16 20:20:49,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:20:49,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:20:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:49,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:20:49,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:49,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617570476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:50,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 34 [2025-03-16 20:20:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374667514] [2025-03-16 20:20:50,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 20:20:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:50,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 20:20:50,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:20:50,230 INFO L87 Difference]: Start difference. First operand 5541 states and 7480 transitions. Second operand has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:20:52,465 INFO L93 Difference]: Finished difference Result 9672 states and 12539 transitions. [2025-03-16 20:20:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-16 20:20:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 0 states have call successors, (0), 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-16 20:20:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:20:52,478 INFO L225 Difference]: With dead ends: 9672 [2025-03-16 20:20:52,478 INFO L226 Difference]: Without dead ends: 6801 [2025-03-16 20:20:52,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1110, Invalid=4292, Unknown=0, NotChecked=0, Total=5402 [2025-03-16 20:20:52,483 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 13114 mSDsluCounter, 18438 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13114 SdHoareTripleChecker+Valid, 19962 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:20:52,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13114 Valid, 19962 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:20:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6801 states. [2025-03-16 20:20:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6801 to 5746. [2025-03-16 20:20:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 5744 states have (on average 1.3377437325905293) internal successors, (7684), 5745 states have internal predecessors, (7684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 7684 transitions. [2025-03-16 20:20:52,607 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 7684 transitions. Word has length 57 [2025-03-16 20:20:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:20:52,607 INFO L471 AbstractCegarLoop]: Abstraction has 5746 states and 7684 transitions. [2025-03-16 20:20:52,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:20:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 7684 transitions. [2025-03-16 20:20:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:20:52,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:20:52,609 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:20:52,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:20:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:52,810 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:20:52,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:20:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1852467681, now seen corresponding path program 1 times [2025-03-16 20:20:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:20:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053468593] [2025-03-16 20:20:52,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:20:52,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:20:52,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:20:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:52,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:53,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:20:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053468593] [2025-03-16 20:20:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053468593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:20:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938455836] [2025-03-16 20:20:53,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:20:53,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:20:53,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:20:53,475 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-16 20:20:53,477 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-16 20:20:53,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:20:53,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:20:53,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:20:53,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:20:53,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:20:53,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:20:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:55,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:20:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:20:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938455836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:20:57,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:20:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 48 [2025-03-16 20:20:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850693341] [2025-03-16 20:20:57,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:20:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 20:20:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:20:57,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 20:20:57,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2073, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 20:20:57,297 INFO L87 Difference]: Start difference. First operand 5746 states and 7684 transitions. Second operand has 48 states, 48 states have (on average 5.520833333333333) internal successors, (265), 48 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:22,224 INFO L93 Difference]: Finished difference Result 12708 states and 16367 transitions. [2025-03-16 20:21:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2025-03-16 20:21:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.520833333333333) internal successors, (265), 48 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 20:21:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:22,238 INFO L225 Difference]: With dead ends: 12708 [2025-03-16 20:21:22,238 INFO L226 Difference]: Without dead ends: 9542 [2025-03-16 20:21:22,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22643 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=8248, Invalid=54002, Unknown=0, NotChecked=0, Total=62250 [2025-03-16 20:21:22,248 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 30340 mSDsluCounter, 24500 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30340 SdHoareTripleChecker+Valid, 26099 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:22,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30340 Valid, 26099 Invalid, 3623 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [238 Valid, 3385 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 20:21:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9542 states. [2025-03-16 20:21:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9542 to 6410. [2025-03-16 20:21:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6410 states, 6408 states have (on average 1.3132022471910112) internal successors, (8415), 6409 states have internal predecessors, (8415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 8415 transitions. [2025-03-16 20:21:22,447 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 8415 transitions. Word has length 93 [2025-03-16 20:21:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:22,447 INFO L471 AbstractCegarLoop]: Abstraction has 6410 states and 8415 transitions. [2025-03-16 20:21:22,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.520833333333333) internal successors, (265), 48 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 8415 transitions. [2025-03-16 20:21:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:21:22,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:22,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:22,456 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-16 20:21:22,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:22,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1381322593, now seen corresponding path program 1 times [2025-03-16 20:21:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104236451] [2025-03-16 20:21:22,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:21:22,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:21:22,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:22,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104236451] [2025-03-16 20:21:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104236451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927890343] [2025-03-16 20:21:22,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:22,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:22,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:22,768 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-16 20:21:22,770 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-16 20:21:22,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:21:22,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:21:22,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:22,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:22,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:21:22,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:22,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:21:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927890343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:22,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:21:22,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 20:21:22,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693602039] [2025-03-16 20:21:22,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:22,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:22,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:22,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:21:22,863 INFO L87 Difference]: Start difference. First operand 6410 states and 8415 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:25,392 INFO L93 Difference]: Finished difference Result 9416 states and 13342 transitions. [2025-03-16 20:21:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 20:21:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:25,401 INFO L225 Difference]: With dead ends: 9416 [2025-03-16 20:21:25,401 INFO L226 Difference]: Without dead ends: 7912 [2025-03-16 20:21:25,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:21:25,404 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 745 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:25,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1287 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 20:21:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7912 states. [2025-03-16 20:21:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7912 to 7912. [2025-03-16 20:21:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7912 states, 7910 states have (on average 1.336409608091024) internal successors, (10571), 7911 states have internal predecessors, (10571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7912 states to 7912 states and 10571 transitions. [2025-03-16 20:21:25,627 INFO L78 Accepts]: Start accepts. Automaton has 7912 states and 10571 transitions. Word has length 94 [2025-03-16 20:21:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 7912 states and 10571 transitions. [2025-03-16 20:21:25,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7912 states and 10571 transitions. [2025-03-16 20:21:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:21:25,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:25,629 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:25,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:21:25,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:25,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1264645343, now seen corresponding path program 1 times [2025-03-16 20:21:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379163100] [2025-03-16 20:21:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:21:25,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:21:25,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379163100] [2025-03-16 20:21:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379163100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:26,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004497099] [2025-03-16 20:21:26,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:26,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:26,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:26,577 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-16 20:21:26,578 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-16 20:21:26,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:21:26,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:21:26,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:26,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:26,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:21:26,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:27,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004497099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:29,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 53 [2025-03-16 20:21:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505000161] [2025-03-16 20:21:29,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:29,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:21:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:29,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:21:29,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 20:21:29,729 INFO L87 Difference]: Start difference. First operand 7912 states and 10571 transitions. Second operand has 53 states, 53 states have (on average 4.886792452830188) internal successors, (259), 53 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:41,881 INFO L93 Difference]: Finished difference Result 16288 states and 20908 transitions. [2025-03-16 20:21:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-03-16 20:21:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.886792452830188) internal successors, (259), 53 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 20:21:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:41,893 INFO L225 Difference]: With dead ends: 16288 [2025-03-16 20:21:41,893 INFO L226 Difference]: Without dead ends: 12932 [2025-03-16 20:21:41,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8054 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4715, Invalid=24015, Unknown=0, NotChecked=0, Total=28730 [2025-03-16 20:21:41,898 INFO L435 NwaCegarLoop]: 1611 mSDtfsCounter, 23118 mSDsluCounter, 38403 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23118 SdHoareTripleChecker+Valid, 40014 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:41,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23118 Valid, 40014 Invalid, 3396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [183 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:21:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12932 states. [2025-03-16 20:21:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12932 to 12602. [2025-03-16 20:21:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12602 states, 12600 states have (on average 1.2898412698412698) internal successors, (16252), 12601 states have internal predecessors, (16252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12602 states to 12602 states and 16252 transitions. [2025-03-16 20:21:42,396 INFO L78 Accepts]: Start accepts. Automaton has 12602 states and 16252 transitions. Word has length 94 [2025-03-16 20:21:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:42,397 INFO L471 AbstractCegarLoop]: Abstraction has 12602 states and 16252 transitions. [2025-03-16 20:21:42,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.886792452830188) internal successors, (259), 53 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 12602 states and 16252 transitions. [2025-03-16 20:21:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 20:21:42,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:42,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:42,405 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-16 20:21:42,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:42,599 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:42,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1331028136, now seen corresponding path program 1 times [2025-03-16 20:21:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:42,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951823140] [2025-03-16 20:21:42,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:42,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 20:21:42,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 20:21:42,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:42,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951823140] [2025-03-16 20:21:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951823140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092593109] [2025-03-16 20:21:43,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:43,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:43,666 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-16 20:21:43,667 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-16 20:21:43,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 20:21:43,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 20:21:43,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:43,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:43,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:21:43,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:45,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092593109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:47,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 18] total 59 [2025-03-16 20:21:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079664353] [2025-03-16 20:21:47,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:47,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-16 20:21:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:47,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-16 20:21:47,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3188, Unknown=0, NotChecked=0, Total=3422 [2025-03-16 20:21:47,259 INFO L87 Difference]: Start difference. First operand 12602 states and 16252 transitions. Second operand has 59 states, 59 states have (on average 4.423728813559322) internal successors, (261), 59 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)