./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.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.UNBOUNDED.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 ce3fb29712e91707982cc1d90cd5fa002213aad836fd0a7fc53e12556da2c4fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:21:41,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:21:41,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:21:41,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:21:41,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:21:41,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:21:41,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:21:41,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:21:41,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:21:41,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:21:41,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:21:41,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:21:41,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:21:41,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:21:41,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:21:41,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:21:41,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:21:41,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:21:41,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:21:41,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:21:41,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:21:41,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:21:41,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:21:41,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:21:41,892 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 -> ce3fb29712e91707982cc1d90cd5fa002213aad836fd0a7fc53e12556da2c4fe [2025-03-16 20:21:42,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:21:42,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:21:42,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:21:42,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:21:42,091 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:21:42,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:21:43,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4526724/5add895175e24c69ad3cf7be7f672deb/FLAG0f11776ec [2025-03-16 20:21:43,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:21:43,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:21:43,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4526724/5add895175e24c69ad3cf7be7f672deb/FLAG0f11776ec [2025-03-16 20:21:43,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4526724/5add895175e24c69ad3cf7be7f672deb [2025-03-16 20:21:43,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:21:43,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:21:43,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:21:43,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:21:43,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:21:43,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:21:43" (1/1) ... [2025-03-16 20:21:43,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54dd45e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:43, skipping insertion in model container [2025-03-16 20:21:43,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:21:43" (1/1) ... [2025-03-16 20:21:43,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:21:44,150 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.UNBOUNDED.pals+Problem12_label06.c[6450,6463] [2025-03-16 20:21:44,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label06.c[9267,9280] [2025-03-16 20:21:44,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:21:44,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:21:44,617 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.UNBOUNDED.pals+Problem12_label06.c[6450,6463] [2025-03-16 20:21:44,624 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.UNBOUNDED.pals+Problem12_label06.c[9267,9280] [2025-03-16 20:21:44,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:21:44,871 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:21:44,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44 WrapperNode [2025-03-16 20:21:44,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:21:44,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:21:44,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:21:44,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:21:44,877 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:21:44" (1/1) ... [2025-03-16 20:21:44,905 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:21:44" (1/1) ... [2025-03-16 20:21:45,136 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-03-16 20:21:45,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:21:45,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:21:45,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:21:45,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:21:45,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,323 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:21:45,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:21:45,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:21:45,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:21:45,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:21:45,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (1/1) ... [2025-03-16 20:21:45,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:21:45,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:45,572 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:21:45,576 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:21:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:21:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:21:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:21:45,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:21:45,655 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:21:45,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:21:48,872 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2025-03-16 20:21:48,872 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2025-03-16 20:21:48,872 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2025-03-16 20:21:49,015 INFO L? ?]: Removed 730 outVars from TransFormulas that were not future-live. [2025-03-16 20:21:49,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:21:49,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:21:49,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:21:49,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:21:49 BoogieIcfgContainer [2025-03-16 20:21:49,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:21:49,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:21:49,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:21:49,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:21:49,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:21:43" (1/3) ... [2025-03-16 20:21:49,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4d4256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:21:49, skipping insertion in model container [2025-03-16 20:21:49,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:21:44" (2/3) ... [2025-03-16 20:21:49,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4d4256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:21:49, skipping insertion in model container [2025-03-16 20:21:49,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:21:49" (3/3) ... [2025-03-16 20:21:49,047 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:21:49,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:21:49,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label06.c that has 1 procedures, 809 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:21:49,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:21:49,137 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;@2bae60d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:21:49,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:21:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.9764267990074442) internal successors, (1593), 808 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states 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:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:21:49,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:49,147 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:21:49,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash 25766248, now seen corresponding path program 1 times [2025-03-16 20:21:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275822587] [2025-03-16 20:21:49,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:49,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:21:49,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:21:49,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:49,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:49,323 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:21:49,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:49,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275822587] [2025-03-16 20:21:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275822587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:21:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219427373] [2025-03-16 20:21:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:49,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:21:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:49,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:21:49,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:21:49,347 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.9764267990074442) internal successors, (1593), 808 states have internal predecessors, (1593), 0 states have call successors, (0), 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:21:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:49,409 INFO L93 Difference]: Finished difference Result 1598 states and 3148 transitions. [2025-03-16 20:21:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:21:49,412 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:21:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:49,425 INFO L225 Difference]: With dead ends: 1598 [2025-03-16 20:21:49,426 INFO L226 Difference]: Without dead ends: 805 [2025-03-16 20:21:49,430 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:21:49,433 INFO L435 NwaCegarLoop]: 1528 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, 1528 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:21:49,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-16 20:21:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-16 20:21:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2025-03-16 20:21:49,494 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2025-03-16 20:21:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:49,495 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2025-03-16 20:21:49,495 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:21:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2025-03-16 20:21:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:21:49,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:49,495 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:21:49,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:21:49,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:49,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -267636759, now seen corresponding path program 1 times [2025-03-16 20:21:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:49,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458999293] [2025-03-16 20:21:49,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:49,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:21:49,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:21:49,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:49,641 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:21:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458999293] [2025-03-16 20:21:49,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458999293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:49,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:49,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:21:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497236683] [2025-03-16 20:21:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:49,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:21:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:49,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:21:49,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:21:49,643 INFO L87 Difference]: Start difference. First operand 805 states and 1524 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:21:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:49,711 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2025-03-16 20:21:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:21:49,711 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:21:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:49,717 INFO L225 Difference]: With dead ends: 839 [2025-03-16 20:21:49,717 INFO L226 Difference]: Without dead ends: 805 [2025-03-16 20:21:49,717 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:21:49,718 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4549 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:49,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4549 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-16 20:21:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2025-03-16 20:21:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2025-03-16 20:21:49,734 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2025-03-16 20:21:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:49,734 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2025-03-16 20:21:49,734 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:21:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2025-03-16 20:21:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:21:49,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:49,735 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:21:49,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:21:49,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:49,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1350773917, now seen corresponding path program 1 times [2025-03-16 20:21:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:49,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212738911] [2025-03-16 20:21:49,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:49,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:21:49,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:21:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:49,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:49,806 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:21:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212738911] [2025-03-16 20:21:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212738911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:21:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780874443] [2025-03-16 20:21:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:49,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:49,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:49,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:49,808 INFO L87 Difference]: Start difference. First operand 805 states and 1508 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:21:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:52,343 INFO L93 Difference]: Finished difference Result 2309 states and 4381 transitions. [2025-03-16 20:21:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:52,344 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:21:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:52,349 INFO L225 Difference]: With dead ends: 2309 [2025-03-16 20:21:52,350 INFO L226 Difference]: Without dead ends: 1556 [2025-03-16 20:21:52,351 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:21:52,351 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 864 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 497 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.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:52,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 497 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:21:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-16 20:21:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2025-03-16 20:21:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.6312741312741312) internal successors, (2535), 1555 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states 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:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2535 transitions. [2025-03-16 20:21:52,388 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2535 transitions. Word has length 23 [2025-03-16 20:21:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:52,388 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2535 transitions. [2025-03-16 20:21:52,388 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:21:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2535 transitions. [2025-03-16 20:21:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:21:52,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:52,391 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:21:52,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:21:52,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:52,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2091397431, now seen corresponding path program 1 times [2025-03-16 20:21:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320961775] [2025-03-16 20:21:52,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:52,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:21:52,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:21:52,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:52,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:52,506 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:21:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320961775] [2025-03-16 20:21:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320961775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441797392] [2025-03-16 20:21:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:52,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:52,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:52,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:52,508 INFO L87 Difference]: Start difference. First operand 1556 states and 2535 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:21:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:52,593 INFO L93 Difference]: Finished difference Result 1742 states and 2829 transitions. [2025-03-16 20:21:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:21:52,593 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:21:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:52,599 INFO L225 Difference]: With dead ends: 1742 [2025-03-16 20:21:52,599 INFO L226 Difference]: Without dead ends: 1711 [2025-03-16 20:21:52,599 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:21:52,600 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 4632 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4632 SdHoareTripleChecker+Valid, 1780 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:21:52,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4632 Valid, 1780 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2025-03-16 20:21:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1585. [2025-03-16 20:21:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.6304485154769426) internal successors, (2581), 1584 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states 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:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2581 transitions. [2025-03-16 20:21:52,624 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2581 transitions. Word has length 32 [2025-03-16 20:21:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2581 transitions. [2025-03-16 20:21:52,624 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:21:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2581 transitions. [2025-03-16 20:21:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:21:52,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:52,625 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:21:52,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:21:52,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 248945547, now seen corresponding path program 1 times [2025-03-16 20:21:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:52,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603984966] [2025-03-16 20:21:52,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:21:52,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:21:52,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:52,789 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:21:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603984966] [2025-03-16 20:21:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603984966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:52,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:52,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832702014] [2025-03-16 20:21:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:52,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:52,790 INFO L87 Difference]: Start difference. First operand 1585 states and 2581 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:21:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:52,843 INFO L93 Difference]: Finished difference Result 1647 states and 2677 transitions. [2025-03-16 20:21:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:52,844 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:21:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:52,848 INFO L225 Difference]: With dead ends: 1647 [2025-03-16 20:21:52,848 INFO L226 Difference]: Without dead ends: 1587 [2025-03-16 20:21:52,849 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:21:52,849 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 4420 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:52,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 1593 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-03-16 20:21:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1585. [2025-03-16 20:21:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.6298168035375868) internal successors, (2580), 1584 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states 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:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2580 transitions. [2025-03-16 20:21:52,872 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2580 transitions. Word has length 34 [2025-03-16 20:21:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:52,872 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2580 transitions. [2025-03-16 20:21:52,872 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:21:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2580 transitions. [2025-03-16 20:21:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:21:52,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:52,873 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:21:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:21:52,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:52,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 247902862, now seen corresponding path program 1 times [2025-03-16 20:21:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524112909] [2025-03-16 20:21:52,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:21:52,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:21:52,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:52,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:52,937 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:21:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524112909] [2025-03-16 20:21:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524112909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:52,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:52,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649234318] [2025-03-16 20:21:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:52,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:52,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:52,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:52,939 INFO L87 Difference]: Start difference. First operand 1585 states and 2580 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:21:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:52,964 INFO L93 Difference]: Finished difference Result 1694 states and 2749 transitions. [2025-03-16 20:21:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:52,965 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:21:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:52,969 INFO L225 Difference]: With dead ends: 1694 [2025-03-16 20:21:52,970 INFO L226 Difference]: Without dead ends: 1634 [2025-03-16 20:21:52,970 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:21:52,970 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:52,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1546 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-16 20:21:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1630. [2025-03-16 20:21:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.625921375921376) internal successors, (2647), 1629 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states 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:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2647 transitions. [2025-03-16 20:21:52,994 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2647 transitions. Word has length 34 [2025-03-16 20:21:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:52,994 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2647 transitions. [2025-03-16 20:21:52,994 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:21:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2647 transitions. [2025-03-16 20:21:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:21:52,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:52,995 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:21:52,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:21:52,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash -871637575, now seen corresponding path program 1 times [2025-03-16 20:21:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:52,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430970552] [2025-03-16 20:21:52,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:53,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:21:53,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:21:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,163 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:21:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430970552] [2025-03-16 20:21:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430970552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:21:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264281226] [2025-03-16 20:21:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:21:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:53,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:21:53,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:21:53,164 INFO L87 Difference]: Start difference. First operand 1630 states and 2647 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:21:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:53,201 INFO L93 Difference]: Finished difference Result 1636 states and 2654 transitions. [2025-03-16 20:21:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:21:53,202 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:21:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:53,207 INFO L225 Difference]: With dead ends: 1636 [2025-03-16 20:21:53,207 INFO L226 Difference]: Without dead ends: 1634 [2025-03-16 20:21:53,207 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:21:53,208 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 6005 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7509 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:53,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7509 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-16 20:21:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-16 20:21:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.6237745098039216) internal successors, (2650), 1633 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states 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:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2650 transitions. [2025-03-16 20:21:53,233 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2650 transitions. Word has length 35 [2025-03-16 20:21:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:53,233 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2650 transitions. [2025-03-16 20:21:53,233 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:21:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2650 transitions. [2025-03-16 20:21:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:21:53,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:53,234 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:21:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:21:53,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:53,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 318841389, now seen corresponding path program 1 times [2025-03-16 20:21:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223214312] [2025-03-16 20:21:53,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:53,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:21:53,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:21:53,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,271 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:21:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223214312] [2025-03-16 20:21:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223214312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:53,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:53,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728095104] [2025-03-16 20:21:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:53,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:53,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:53,273 INFO L87 Difference]: Start difference. First operand 1634 states and 2650 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:21:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:53,291 INFO L93 Difference]: Finished difference Result 1836 states and 2950 transitions. [2025-03-16 20:21:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:53,292 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:21:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:53,297 INFO L225 Difference]: With dead ends: 1836 [2025-03-16 20:21:53,297 INFO L226 Difference]: Without dead ends: 1727 [2025-03-16 20:21:53,298 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:21:53,298 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 1475 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:53,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-03-16 20:21:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1725. [2025-03-16 20:21:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1723 states have (on average 1.6140452698781196) internal successors, (2781), 1724 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states 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:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2781 transitions. [2025-03-16 20:21:53,324 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2781 transitions. Word has length 36 [2025-03-16 20:21:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:53,325 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2781 transitions. [2025-03-16 20:21:53,325 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:21:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2781 transitions. [2025-03-16 20:21:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:21:53,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:53,327 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:21:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:21:53,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:53,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash -230947539, now seen corresponding path program 1 times [2025-03-16 20:21:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932146599] [2025-03-16 20:21:53,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:53,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:21:53,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:21:53,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,375 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:21:53,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:53,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932146599] [2025-03-16 20:21:53,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932146599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:53,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:53,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728918881] [2025-03-16 20:21:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:53,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:53,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:53,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:53,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:53,376 INFO L87 Difference]: Start difference. First operand 1725 states and 2781 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:21:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:53,397 INFO L93 Difference]: Finished difference Result 2093 states and 3315 transitions. [2025-03-16 20:21:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:53,397 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:21:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:53,404 INFO L225 Difference]: With dead ends: 2093 [2025-03-16 20:21:53,404 INFO L226 Difference]: Without dead ends: 1893 [2025-03-16 20:21:53,405 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:21:53,407 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 1473 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1590 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:21:53,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1590 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2025-03-16 20:21:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1891. [2025-03-16 20:21:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.5939650608787719) internal successors, (3011), 1890 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states 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:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3011 transitions. [2025-03-16 20:21:53,439 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3011 transitions. Word has length 36 [2025-03-16 20:21:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 3011 transitions. [2025-03-16 20:21:53,440 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:21:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3011 transitions. [2025-03-16 20:21:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 20:21:53,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:53,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:21:53,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2049598067, now seen corresponding path program 1 times [2025-03-16 20:21:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795010479] [2025-03-16 20:21:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:53,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 20:21:53,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 20:21:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,468 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:21:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795010479] [2025-03-16 20:21:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795010479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:53,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708632860] [2025-03-16 20:21:53,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:53,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:53,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:53,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:53,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:53,469 INFO L87 Difference]: Start difference. First operand 1891 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:53,493 INFO L93 Difference]: Finished difference Result 2282 states and 3585 transitions. [2025-03-16 20:21:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 20:21:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:53,500 INFO L225 Difference]: With dead ends: 2282 [2025-03-16 20:21:53,500 INFO L226 Difference]: Without dead ends: 2063 [2025-03-16 20:21:53,500 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:21:53,501 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1474 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1589 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:21:53,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1589 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-16 20:21:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2061. [2025-03-16 20:21:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2059 states have (on average 1.5779504613890238) internal successors, (3249), 2060 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states 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:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3249 transitions. [2025-03-16 20:21:53,533 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3249 transitions. Word has length 38 [2025-03-16 20:21:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:53,533 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3249 transitions. [2025-03-16 20:21:53,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3249 transitions. [2025-03-16 20:21:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:21:53,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:53,534 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:21:53,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:21:53,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:53,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 981101146, now seen corresponding path program 1 times [2025-03-16 20:21:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673985004] [2025-03-16 20:21:53,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:53,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:21:53,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:21:53,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,627 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:21:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673985004] [2025-03-16 20:21:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673985004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:53,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:53,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96296779] [2025-03-16 20:21:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:53,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:53,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:53,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:53,629 INFO L87 Difference]: Start difference. First operand 2061 states and 3249 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:21:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:53,697 INFO L93 Difference]: Finished difference Result 3785 states and 5697 transitions. [2025-03-16 20:21:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:53,698 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:21:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:53,707 INFO L225 Difference]: With dead ends: 3785 [2025-03-16 20:21:53,707 INFO L226 Difference]: Without dead ends: 3251 [2025-03-16 20:21:53,710 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:21:53,711 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3048 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:53,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 3150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2025-03-16 20:21:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2593. [2025-03-16 20:21:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2591 states have (on average 1.5426476263990738) internal successors, (3997), 2592 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states 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:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3997 transitions. [2025-03-16 20:21:53,757 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3997 transitions. Word has length 50 [2025-03-16 20:21:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:53,758 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 3997 transitions. [2025-03-16 20:21:53,758 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:21:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3997 transitions. [2025-03-16 20:21:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:21:53,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:53,759 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:21:53,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:21:53,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 431312218, now seen corresponding path program 1 times [2025-03-16 20:21:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473590133] [2025-03-16 20:21:53,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:53,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:21:53,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:21:53,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:53,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:53,849 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:21:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473590133] [2025-03-16 20:21:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473590133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:53,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:53,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765168048] [2025-03-16 20:21:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:53,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:53,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:53,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:53,851 INFO L87 Difference]: Start difference. First operand 2593 states and 3997 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:21:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:53,921 INFO L93 Difference]: Finished difference Result 4317 states and 6445 transitions. [2025-03-16 20:21:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:53,922 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:21:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:53,931 INFO L225 Difference]: With dead ends: 4317 [2025-03-16 20:21:53,931 INFO L226 Difference]: Without dead ends: 3783 [2025-03-16 20:21:53,933 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:21:53,933 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3053 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:53,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 3139 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2025-03-16 20:21:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3393. [2025-03-16 20:21:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3391 states have (on average 1.506635210852256) internal successors, (5109), 3392 states have internal predecessors, (5109), 0 states have call successors, (0), 0 states 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:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 5109 transitions. [2025-03-16 20:21:54,012 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 5109 transitions. Word has length 50 [2025-03-16 20:21:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:54,012 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 5109 transitions. [2025-03-16 20:21:54,012 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:21:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 5109 transitions. [2025-03-16 20:21:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:21:54,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:54,014 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:21:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:21:54,014 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2017421604, now seen corresponding path program 1 times [2025-03-16 20:21:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226924939] [2025-03-16 20:21:54,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:54,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:21:54,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:21:54,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:54,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:54,082 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:21:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:54,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226924939] [2025-03-16 20:21:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226924939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:54,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:54,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192798283] [2025-03-16 20:21:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:54,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:54,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:54,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:54,084 INFO L87 Difference]: Start difference. First operand 3393 states and 5109 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:21:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:54,117 INFO L93 Difference]: Finished difference Result 4756 states and 7059 transitions. [2025-03-16 20:21:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:54,117 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:21:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:54,125 INFO L225 Difference]: With dead ends: 4756 [2025-03-16 20:21:54,125 INFO L226 Difference]: Without dead ends: 2890 [2025-03-16 20:21:54,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:54,131 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 34 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3025 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:21:54,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2025-03-16 20:21:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2025-03-16 20:21:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2886 states have (on average 1.5273735273735274) internal successors, (4408), 2887 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states 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:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4408 transitions. [2025-03-16 20:21:54,176 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4408 transitions. Word has length 52 [2025-03-16 20:21:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4408 transitions. [2025-03-16 20:21:54,176 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:21:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4408 transitions. [2025-03-16 20:21:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:21:54,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:54,177 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] [2025-03-16 20:21:54,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:21:54,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:54,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1273131398, now seen corresponding path program 1 times [2025-03-16 20:21:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183870254] [2025-03-16 20:21:54,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:54,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:21:54,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:21:54,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:54,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:54,250 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:21:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183870254] [2025-03-16 20:21:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183870254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:54,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:21:54,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762256110] [2025-03-16 20:21:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:54,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:21:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:54,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:21:54,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:21:54,252 INFO L87 Difference]: Start difference. First operand 2888 states and 4408 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:54,334 INFO L93 Difference]: Finished difference Result 4048 states and 6068 transitions. [2025-03-16 20:21:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:21:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 20:21:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:54,346 INFO L225 Difference]: With dead ends: 4048 [2025-03-16 20:21:54,346 INFO L226 Difference]: Without dead ends: 3662 [2025-03-16 20:21:54,348 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:21:54,348 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3043 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:54,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 3172 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2025-03-16 20:21:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3272. [2025-03-16 20:21:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3270 states have (on average 1.5143730886850153) internal successors, (4952), 3271 states have internal predecessors, (4952), 0 states have call successors, (0), 0 states 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:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4952 transitions. [2025-03-16 20:21:54,415 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4952 transitions. Word has length 52 [2025-03-16 20:21:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:54,415 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4952 transitions. [2025-03-16 20:21:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4952 transitions. [2025-03-16 20:21:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:21:54,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:54,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:54,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:21:54,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:54,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash 974834018, now seen corresponding path program 1 times [2025-03-16 20:21:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369106147] [2025-03-16 20:21:54,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:54,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:21:54,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:21:54,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:54,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:54,477 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:21:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369106147] [2025-03-16 20:21:54,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369106147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:54,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:54,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894364954] [2025-03-16 20:21:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:54,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:54,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:54,479 INFO L87 Difference]: Start difference. First operand 3272 states and 4952 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:21:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:54,504 INFO L93 Difference]: Finished difference Result 4140 states and 6178 transitions. [2025-03-16 20:21:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:54,505 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:21:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:54,509 INFO L225 Difference]: With dead ends: 4140 [2025-03-16 20:21:54,509 INFO L226 Difference]: Without dead ends: 2410 [2025-03-16 20:21:54,511 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:21:54,511 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 29 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3010 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:21:54,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3010 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2025-03-16 20:21:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2025-03-16 20:21:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2406 states have (on average 1.541978387364921) internal successors, (3710), 2407 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states 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:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3710 transitions. [2025-03-16 20:21:54,543 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3710 transitions. Word has length 53 [2025-03-16 20:21:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:54,543 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3710 transitions. [2025-03-16 20:21:54,544 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:21:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3710 transitions. [2025-03-16 20:21:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:21:54,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:54,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:21:54,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:54,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -918465573, now seen corresponding path program 1 times [2025-03-16 20:21:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:54,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815264171] [2025-03-16 20:21:54,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:54,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:21:54,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:21:54,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:54,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:54,599 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:21:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815264171] [2025-03-16 20:21:54,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815264171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:21:54,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:21:54,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:21:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897712509] [2025-03-16 20:21:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:21:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:21:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:54,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:21:54,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:21:54,600 INFO L87 Difference]: Start difference. First operand 2408 states and 3710 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:54,619 INFO L93 Difference]: Finished difference Result 2844 states and 4315 transitions. [2025-03-16 20:21:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:21:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:21:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:54,623 INFO L225 Difference]: With dead ends: 2844 [2025-03-16 20:21:54,623 INFO L226 Difference]: Without dead ends: 1978 [2025-03-16 20:21:54,624 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:21:54,624 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 26 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2995 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:21:54,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2995 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:21:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2025-03-16 20:21:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1976. [2025-03-16 20:21:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1974 states have (on average 1.5694022289766971) internal successors, (3098), 1975 states have internal predecessors, (3098), 0 states have call successors, (0), 0 states 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:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3098 transitions. [2025-03-16 20:21:54,654 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3098 transitions. Word has length 55 [2025-03-16 20:21:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:54,655 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 3098 transitions. [2025-03-16 20:21:54,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:21:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3098 transitions. [2025-03-16 20:21:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:21:54,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:54,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:21:54,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:21:54,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:54,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1545027244, now seen corresponding path program 1 times [2025-03-16 20:21:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193879269] [2025-03-16 20:21:54,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:54,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:54,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:54,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:54,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:21:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193879269] [2025-03-16 20:21:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193879269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278051847] [2025-03-16 20:21:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:55,447 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:21:55,448 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:21:55,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:21:55,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:21:55,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:55,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:55,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 20:21:55,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:55,659 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:21:55,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:55,797 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:21:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278051847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:55,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2025-03-16 20:21:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937978208] [2025-03-16 20:21:55,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:21:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:55,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:21:55,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:21:55,799 INFO L87 Difference]: Start difference. First operand 1976 states and 3098 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:57,263 INFO L93 Difference]: Finished difference Result 4241 states and 6136 transitions. [2025-03-16 20:21:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 20:21:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 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:21:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:57,271 INFO L225 Difference]: With dead ends: 4241 [2025-03-16 20:21:57,272 INFO L226 Difference]: Without dead ends: 3807 [2025-03-16 20:21:57,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=538, Invalid=2324, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:21:57,275 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 9604 mSDsluCounter, 6196 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9604 SdHoareTripleChecker+Valid, 7691 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:57,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9604 Valid, 7691 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:21:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2025-03-16 20:21:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3773. [2025-03-16 20:21:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3773 states, 3771 states have (on average 1.416865552903739) internal successors, (5343), 3772 states have internal predecessors, (5343), 0 states have call successors, (0), 0 states 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:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 5343 transitions. [2025-03-16 20:21:57,333 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 5343 transitions. Word has length 57 [2025-03-16 20:21:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:57,333 INFO L471 AbstractCegarLoop]: Abstraction has 3773 states and 5343 transitions. [2025-03-16 20:21:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 5343 transitions. [2025-03-16 20:21:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:57,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:57,334 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, 1] [2025-03-16 20:21:57,341 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:21:57,535 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:21:57,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:57,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1981655035, now seen corresponding path program 1 times [2025-03-16 20:21:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505707077] [2025-03-16 20:21:57,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:57,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:57,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:57,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:57,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:57,820 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:21:57,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:57,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505707077] [2025-03-16 20:21:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505707077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493238081] [2025-03-16 20:21:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:57,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:57,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:57,823 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:21:57,824 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:21:57,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:57,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:57,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:57,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:57,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:21:57,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:58,213 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:21:58,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:21:58,652 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:21:58,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493238081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:21:58,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:21:58,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:21:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780051560] [2025-03-16 20:21:58,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:21:58,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:21:58,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:21:58,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:21:58,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:21:58,653 INFO L87 Difference]: Start difference. First operand 3773 states and 5343 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:21:58,968 INFO L93 Difference]: Finished difference Result 5793 states and 7923 transitions. [2025-03-16 20:21:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:21:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:21:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:21:58,974 INFO L225 Difference]: With dead ends: 5793 [2025-03-16 20:21:58,974 INFO L226 Difference]: Without dead ends: 3879 [2025-03-16 20:21:58,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:21:58,977 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 13539 mSDsluCounter, 3127 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13539 SdHoareTripleChecker+Valid, 4619 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:21:58,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13539 Valid, 4619 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:21:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2025-03-16 20:21:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3571. [2025-03-16 20:21:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3569 states have (on average 1.4174838890445502) internal successors, (5059), 3570 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states 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:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 5059 transitions. [2025-03-16 20:21:59,034 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 5059 transitions. Word has length 58 [2025-03-16 20:21:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:21:59,035 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 5059 transitions. [2025-03-16 20:21:59,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 5059 transitions. [2025-03-16 20:21:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:21:59,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:21:59,037 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, 1] [2025-03-16 20:21:59,043 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:21:59,237 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:21:59,237 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:21:59,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:21:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1640377797, now seen corresponding path program 1 times [2025-03-16 20:21:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:21:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564752491] [2025-03-16 20:21:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:21:59,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:59,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:59,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:59,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:59,455 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:21:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:21:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564752491] [2025-03-16 20:21:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564752491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:21:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565873727] [2025-03-16 20:21:59,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:21:59,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:21:59,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:21:59,458 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:21:59,460 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:21:59,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:21:59,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:21:59,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:21:59,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:21:59,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 20:21:59,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:21:59,913 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:21:59,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:00,473 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:22:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565873727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:00,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:00,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2025-03-16 20:22:00,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010394015] [2025-03-16 20:22:00,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:00,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:22:00,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:00,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:22:00,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:22:00,475 INFO L87 Difference]: Start difference. First operand 3571 states and 5059 transitions. Second operand has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:22:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:00,956 INFO L93 Difference]: Finished difference Result 7270 states and 9766 transitions. [2025-03-16 20:22:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 20:22:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:22:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:00,965 INFO L225 Difference]: With dead ends: 7270 [2025-03-16 20:22:00,965 INFO L226 Difference]: Without dead ends: 5601 [2025-03-16 20:22:00,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=1198, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 20:22:00,968 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 11950 mSDsluCounter, 7724 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11950 SdHoareTripleChecker+Valid, 9216 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:00,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11950 Valid, 9216 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:22:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5601 states. [2025-03-16 20:22:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5601 to 5535. [2025-03-16 20:22:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5533 states have (on average 1.3495391288631846) internal successors, (7467), 5534 states have internal predecessors, (7467), 0 states have call successors, (0), 0 states 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:22:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 7467 transitions. [2025-03-16 20:22:01,060 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 7467 transitions. Word has length 58 [2025-03-16 20:22:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:01,060 INFO L471 AbstractCegarLoop]: Abstraction has 5535 states and 7467 transitions. [2025-03-16 20:22:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.178571428571429) internal successors, (145), 28 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:22:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 7467 transitions. [2025-03-16 20:22:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:22:01,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:01,061 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, 1] [2025-03-16 20:22:01,068 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:22:01,263 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:22:01,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1084050555, now seen corresponding path program 1 times [2025-03-16 20:22:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781537298] [2025-03-16 20:22:01,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:01,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:22:01,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:22:01,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:01,434 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:22:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781537298] [2025-03-16 20:22:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781537298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895533120] [2025-03-16 20:22:01,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:01,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:01,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:01,437 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:22:01,439 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:22:01,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:22:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:22:01,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:01,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:01,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:22:01,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:01,781 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:22:01,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:02,245 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:22:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895533120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:02,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:22:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494208566] [2025-03-16 20:22:02,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:02,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:22:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:02,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:22:02,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:22:02,247 INFO L87 Difference]: Start difference. First operand 5535 states and 7467 transitions. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:22:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:02,601 INFO L93 Difference]: Finished difference Result 12378 states and 15983 transitions. [2025-03-16 20:22:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:22:02,602 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 20:22:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:02,613 INFO L225 Difference]: With dead ends: 12378 [2025-03-16 20:22:02,613 INFO L226 Difference]: Without dead ends: 8968 [2025-03-16 20:22:02,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:22:02,618 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 13605 mSDsluCounter, 4741 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13605 SdHoareTripleChecker+Valid, 6235 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:02,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13605 Valid, 6235 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:22:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8968 states. [2025-03-16 20:22:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8968 to 8964. [2025-03-16 20:22:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8964 states, 8962 states have (on average 1.3012720374916313) internal successors, (11662), 8963 states have internal predecessors, (11662), 0 states have call successors, (0), 0 states 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:22:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 11662 transitions. [2025-03-16 20:22:02,892 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 11662 transitions. Word has length 58 [2025-03-16 20:22:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:02,892 INFO L471 AbstractCegarLoop]: Abstraction has 8964 states and 11662 transitions. [2025-03-16 20:22:02,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:22:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 11662 transitions. [2025-03-16 20:22:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:22:02,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:02,893 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, 1, 1] [2025-03-16 20:22:02,900 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:22:03,094 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:22:03,095 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:03,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash 542733369, now seen corresponding path program 1 times [2025-03-16 20:22:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428074931] [2025-03-16 20:22:03,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:03,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:03,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:03,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:03,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:03,665 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:22:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428074931] [2025-03-16 20:22:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428074931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987915576] [2025-03-16 20:22:03,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:03,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:03,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:03,667 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:22:03,668 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:22:03,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:03,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:03,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:03,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:03,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 20:22:03,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:04,145 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:22:04,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:04,887 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:22:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987915576] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:04,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2025-03-16 20:22:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768574693] [2025-03-16 20:22:04,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:04,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:22:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:04,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:22:04,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:22:04,889 INFO L87 Difference]: Start difference. First operand 8964 states and 11662 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:22:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:07,974 INFO L93 Difference]: Finished difference Result 14090 states and 18081 transitions. [2025-03-16 20:22:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-16 20:22:07,974 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:22:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:07,986 INFO L225 Difference]: With dead ends: 14090 [2025-03-16 20:22:07,986 INFO L226 Difference]: Without dead ends: 9322 [2025-03-16 20:22:07,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1533, Invalid=6123, Unknown=0, NotChecked=0, Total=7656 [2025-03-16 20:22:07,992 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 11579 mSDsluCounter, 21534 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11579 SdHoareTripleChecker+Valid, 23049 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:07,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11579 Valid, 23049 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:22:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9322 states. [2025-03-16 20:22:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9322 to 6362. [2025-03-16 20:22:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6362 states, 6360 states have (on average 1.32625786163522) internal successors, (8435), 6361 states have internal predecessors, (8435), 0 states have call successors, (0), 0 states 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:22:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 8435 transitions. [2025-03-16 20:22:08,208 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 8435 transitions. Word has length 59 [2025-03-16 20:22:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:08,208 INFO L471 AbstractCegarLoop]: Abstraction has 6362 states and 8435 transitions. [2025-03-16 20:22:08,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:22:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 8435 transitions. [2025-03-16 20:22:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:22:08,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:08,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:08,219 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:22:08,413 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:22:08,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 450905028, now seen corresponding path program 1 times [2025-03-16 20:22:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35648302] [2025-03-16 20:22:08,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:08,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:22:08,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:22:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:09,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:09,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35648302] [2025-03-16 20:22:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35648302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:09,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240212478] [2025-03-16 20:22:09,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:09,444 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:22:09,445 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:22:09,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:22:09,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:22:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:09,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:22:09,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:10,782 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:22:10,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240212478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:12,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 52 [2025-03-16 20:22:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922994508] [2025-03-16 20:22:12,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 20:22:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 20:22:12,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2378, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 20:22:12,667 INFO L87 Difference]: Start difference. First operand 6362 states and 8435 transitions. Second operand has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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:22:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:23,341 INFO L93 Difference]: Finished difference Result 15231 states and 19433 transitions. [2025-03-16 20:22:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-16 20:22:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 20:22:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:23,355 INFO L225 Difference]: With dead ends: 15231 [2025-03-16 20:22:23,356 INFO L226 Difference]: Without dead ends: 12655 [2025-03-16 20:22:23,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3318, Invalid=14772, Unknown=0, NotChecked=0, Total=18090 [2025-03-16 20:22:23,362 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 29116 mSDsluCounter, 25524 mSDsCounter, 0 mSdLazyCounter, 2976 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29116 SdHoareTripleChecker+Valid, 27077 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:23,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29116 Valid, 27077 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2976 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:22:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2025-03-16 20:22:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 6954. [2025-03-16 20:22:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6954 states, 6952 states have (on average 1.32307249712313) internal successors, (9198), 6953 states have internal predecessors, (9198), 0 states have call successors, (0), 0 states 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:22:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 9198 transitions. [2025-03-16 20:22:23,615 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 9198 transitions. Word has length 60 [2025-03-16 20:22:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:23,615 INFO L471 AbstractCegarLoop]: Abstraction has 6954 states and 9198 transitions. [2025-03-16 20:22:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.0576923076923075) internal successors, (159), 52 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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:22:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 9198 transitions. [2025-03-16 20:22:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:22:23,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:23,617 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:22:23,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:22:23,817 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:22:23,818 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1692723775, now seen corresponding path program 1 times [2025-03-16 20:22:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824386307] [2025-03-16 20:22:23,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:23,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:22:23,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:22:23,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:23,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:23,946 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:22:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:23,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824386307] [2025-03-16 20:22:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824386307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:23,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834429558] [2025-03-16 20:22:23,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:23,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:23,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:23,949 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:22:23,951 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:22:24,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:22:24,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:22:24,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:24,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:24,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:22:24,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:24,064 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:22:24,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:22:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834429558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:24,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:22:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 20:22:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091445385] [2025-03-16 20:22:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:24,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:24,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:24,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:24,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:24,066 INFO L87 Difference]: Start difference. First operand 6954 states and 9198 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:22:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:26,375 INFO L93 Difference]: Finished difference Result 9960 states and 14125 transitions. [2025-03-16 20:22:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:26,375 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:22:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:26,382 INFO L225 Difference]: With dead ends: 9960 [2025-03-16 20:22:26,382 INFO L226 Difference]: Without dead ends: 8456 [2025-03-16 20:22:26,384 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:22:26,384 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 745 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1295 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:26,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1295 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 20:22:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8456 states. [2025-03-16 20:22:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8456 to 8456. [2025-03-16 20:22:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8456 states, 8454 states have (on average 1.3430328838419683) internal successors, (11354), 8455 states have internal predecessors, (11354), 0 states have call successors, (0), 0 states 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:22:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 11354 transitions. [2025-03-16 20:22:26,633 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 11354 transitions. Word has length 94 [2025-03-16 20:22:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:26,633 INFO L471 AbstractCegarLoop]: Abstraction has 8456 states and 11354 transitions. [2025-03-16 20:22:26,633 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:22:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 11354 transitions. [2025-03-16 20:22:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:22:26,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:26,635 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, 1, 1, 1] [2025-03-16 20:22:26,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:22:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:26,835 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1531871062, now seen corresponding path program 1 times [2025-03-16 20:22:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101841182] [2025-03-16 20:22:26,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:26,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:22:26,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:22:26,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:26,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:26,877 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:22:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101841182] [2025-03-16 20:22:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101841182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:26,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:26,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:22:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513439370] [2025-03-16 20:22:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:26,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:26,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:26,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:26,879 INFO L87 Difference]: Start difference. First operand 8456 states and 11354 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:22:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:29,371 INFO L93 Difference]: Finished difference Result 14466 states and 20593 transitions. [2025-03-16 20:22:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:29,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 20:22:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:29,382 INFO L225 Difference]: With dead ends: 14466 [2025-03-16 20:22:29,382 INFO L226 Difference]: Without dead ends: 11460 [2025-03-16 20:22:29,386 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:22:29,386 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 844 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:29,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 516 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 20:22:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11460 states. [2025-03-16 20:22:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 11460. [2025-03-16 20:22:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11460 states, 11458 states have (on average 1.3076453133182055) internal successors, (14983), 11459 states have internal predecessors, (14983), 0 states have call successors, (0), 0 states 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:22:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11460 states to 11460 states and 14983 transitions. [2025-03-16 20:22:29,757 INFO L78 Accepts]: Start accepts. Automaton has 11460 states and 14983 transitions. Word has length 97 [2025-03-16 20:22:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:29,758 INFO L471 AbstractCegarLoop]: Abstraction has 11460 states and 14983 transitions. [2025-03-16 20:22:29,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:22:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11460 states and 14983 transitions. [2025-03-16 20:22:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:22:29,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:29,760 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, 1, 1, 1] [2025-03-16 20:22:29,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:22:29,760 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:29,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash -639024222, now seen corresponding path program 1 times [2025-03-16 20:22:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559645719] [2025-03-16 20:22:29,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:29,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:29,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:22:29,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:22:29,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:29,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559645719] [2025-03-16 20:22:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559645719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823618826] [2025-03-16 20:22:30,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:30,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:30,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:30,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:30,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:22:30,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:22:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:22:30,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:30,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:30,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:22:30,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:31,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823618826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:34,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 22] total 57 [2025-03-16 20:22:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536316721] [2025-03-16 20:22:34,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 20:22:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:34,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 20:22:34,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2861, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 20:22:34,749 INFO L87 Difference]: Start difference. First operand 11460 states and 14983 transitions. Second operand has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:22:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:45,260 INFO L93 Difference]: Finished difference Result 19580 states and 25138 transitions. [2025-03-16 20:22:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-16 20:22:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 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 97 [2025-03-16 20:22:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:45,274 INFO L225 Difference]: With dead ends: 19580 [2025-03-16 20:22:45,274 INFO L226 Difference]: Without dead ends: 16684 [2025-03-16 20:22:45,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7895 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4305, Invalid=21455, Unknown=0, NotChecked=0, Total=25760 [2025-03-16 20:22:45,282 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 35174 mSDsluCounter, 28708 mSDsCounter, 0 mSdLazyCounter, 3261 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35174 SdHoareTripleChecker+Valid, 30253 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:45,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35174 Valid, 30253 Invalid, 3385 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 3261 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:22:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16684 states. [2025-03-16 20:22:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16684 to 15213. [2025-03-16 20:22:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15213 states, 15211 states have (on average 1.2888041548879101) internal successors, (19604), 15212 states have internal predecessors, (19604), 0 states have call successors, (0), 0 states 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:22:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15213 states to 15213 states and 19604 transitions. [2025-03-16 20:22:45,765 INFO L78 Accepts]: Start accepts. Automaton has 15213 states and 19604 transitions. Word has length 97 [2025-03-16 20:22:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:45,765 INFO L471 AbstractCegarLoop]: Abstraction has 15213 states and 19604 transitions. [2025-03-16 20:22:45,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:22:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 15213 states and 19604 transitions. [2025-03-16 20:22:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:22:45,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:45,767 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, 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:22:45,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 20:22:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 20:22:45,967 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2117211932, now seen corresponding path program 1 times [2025-03-16 20:22:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188220198] [2025-03-16 20:22:45,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:45,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:22:45,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:22:45,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:45,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188220198] [2025-03-16 20:22:46,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188220198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226210875] [2025-03-16 20:22:46,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:46,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:46,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:46,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 20:22:46,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:22:47,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:22:47,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:47,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:47,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-16 20:22:47,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:50,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226210875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:56,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 73 [2025-03-16 20:22:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027536993] [2025-03-16 20:22:56,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:56,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-16 20:22:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:56,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-16 20:22:56,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=4828, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:22:56,248 INFO L87 Difference]: Start difference. First operand 15213 states and 19604 transitions. Second operand has 73 states, 73 states have (on average 3.835616438356164) internal successors, (280), 73 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)