./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.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.4.ufo.BOUNDED-8.pals+Problem12_label04.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 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:23:39,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:23:39,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:23:39,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:23:39,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:23:39,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:23:39,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:23:39,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:23:39,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:23:39,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:23:39,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:23:39,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:23:39,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:23:39,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:23:39,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:23:39,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:23:39,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:23:39,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:23:39,225 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 -> 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 [2025-03-16 20:23:39,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:23:39,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:23:39,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:23:39,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:23:39,431 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:23:39,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-03-16 20:23:40,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73cfd02e/9818ff6081a7427885d3aeede49abb97/FLAG1d5af0acb [2025-03-16 20:23:40,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:23:40,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-03-16 20:23:41,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73cfd02e/9818ff6081a7427885d3aeede49abb97/FLAG1d5af0acb [2025-03-16 20:23:41,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73cfd02e/9818ff6081a7427885d3aeede49abb97 [2025-03-16 20:23:41,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:23:41,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:23:41,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:23:41,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:23:41,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:23:41,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:23:41" (1/1) ... [2025-03-16 20:23:41,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791212dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:41, skipping insertion in model container [2025-03-16 20:23:41,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:23:41" (1/1) ... [2025-03-16 20:23:41,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:23:41,407 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.4.ufo.BOUNDED-8.pals+Problem12_label04.c[8616,8629] [2025-03-16 20:23:41,453 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.4.ufo.BOUNDED-8.pals+Problem12_label04.c[15677,15690] [2025-03-16 20:23:41,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:23:41,840 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:23:41,866 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.4.ufo.BOUNDED-8.pals+Problem12_label04.c[8616,8629] [2025-03-16 20:23:41,875 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.4.ufo.BOUNDED-8.pals+Problem12_label04.c[15677,15690] [2025-03-16 20:23:42,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:23:42,132 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:23:42,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42 WrapperNode [2025-03-16 20:23:42,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:23:42,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:23:42,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:23:42,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:23:42,138 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:23:42" (1/1) ... [2025-03-16 20:23:42,181 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:23:42" (1/1) ... [2025-03-16 20:23:42,432 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5033 [2025-03-16 20:23:42,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:23:42,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:23:42,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:23:42,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:23:42,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,576 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:23:42,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:23:42,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:23:42,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:23:42,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:23:42,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (1/1) ... [2025-03-16 20:23:42,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:23:42,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:42,824 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:23:42,829 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:23:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:23:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:23:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:23:42,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:23:42,925 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:23:42,926 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:23:46,160 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5020: havoc calculate_output3_#t~ret36#1; [2025-03-16 20:23:46,161 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: havoc calculate_output_#t~ret34#1; [2025-03-16 20:23:46,161 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3530: havoc calculate_output2_#t~ret35#1; [2025-03-16 20:23:46,301 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-03-16 20:23:46,301 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:23:46,331 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:23:46,331 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:23:46,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:23:46 BoogieIcfgContainer [2025-03-16 20:23:46,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:23:46,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:23:46,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:23:46,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:23:46,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:23:41" (1/3) ... [2025-03-16 20:23:46,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501384e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:23:46, skipping insertion in model container [2025-03-16 20:23:46,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:42" (2/3) ... [2025-03-16 20:23:46,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501384e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:23:46, skipping insertion in model container [2025-03-16 20:23:46,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:23:46" (3/3) ... [2025-03-16 20:23:46,342 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-03-16 20:23:46,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:23:46,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c that has 1 procedures, 820 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:23:46,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:23:46,439 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;@777279cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:23:46,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:23:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states 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:23:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:23:46,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:46,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:46,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:46,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1252836054, now seen corresponding path program 1 times [2025-03-16 20:23:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408002553] [2025-03-16 20:23:46,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:46,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:23:46,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:23:46,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:46,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:46,639 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:23:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408002553] [2025-03-16 20:23:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408002553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:23:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427557971] [2025-03-16 20:23:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:46,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:23:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:46,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:23:46,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:23:46,664 INFO L87 Difference]: Start difference. First operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:23:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:46,732 INFO L93 Difference]: Finished difference Result 1613 states and 3176 transitions. [2025-03-16 20:23:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:23:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:23:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:46,746 INFO L225 Difference]: With dead ends: 1613 [2025-03-16 20:23:46,749 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 20:23:46,754 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:23:46,759 INFO L435 NwaCegarLoop]: 1550 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, 1550 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:23:46,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 20:23:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 20:23:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.898034398034398) internal successors, (1545), 815 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states 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:23:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2025-03-16 20:23:46,822 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 19 [2025-03-16 20:23:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:46,823 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2025-03-16 20:23:46,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:23:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2025-03-16 20:23:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:23:46,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:46,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:46,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:23:46,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:46,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1534579433, now seen corresponding path program 1 times [2025-03-16 20:23:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366842644] [2025-03-16 20:23:46,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:46,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:23:46,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:23:46,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:46,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:46,980 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:23:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:46,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366842644] [2025-03-16 20:23:46,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366842644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:46,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:46,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:23:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014061049] [2025-03-16 20:23:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:46,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:46,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:46,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:46,983 INFO L87 Difference]: Start difference. First operand 816 states and 1545 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:23:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:47,064 INFO L93 Difference]: Finished difference Result 889 states and 1660 transitions. [2025-03-16 20:23:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:23:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:47,068 INFO L225 Difference]: With dead ends: 889 [2025-03-16 20:23:47,068 INFO L226 Difference]: Without dead ends: 851 [2025-03-16 20:23:47,068 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:23:47,069 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 55 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:47,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4598 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-16 20:23:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 816. [2025-03-16 20:23:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.8697788697788698) internal successors, (1522), 815 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states 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:23:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1522 transitions. [2025-03-16 20:23:47,130 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1522 transitions. Word has length 19 [2025-03-16 20:23:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:47,130 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1522 transitions. [2025-03-16 20:23:47,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:23:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1522 transitions. [2025-03-16 20:23:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:23:47,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:47,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:47,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:23:47,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:47,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash -215177375, now seen corresponding path program 1 times [2025-03-16 20:23:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687574146] [2025-03-16 20:23:47,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:47,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:23:47,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:23:47,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:47,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:47,296 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:23:47,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:47,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687574146] [2025-03-16 20:23:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687574146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:47,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:47,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121892569] [2025-03-16 20:23:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:47,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:47,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:47,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:47,298 INFO L87 Difference]: Start difference. First operand 816 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:23:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:47,424 INFO L93 Difference]: Finished difference Result 1096 states and 1970 transitions. [2025-03-16 20:23:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:23:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 20:23:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:47,429 INFO L225 Difference]: With dead ends: 1096 [2025-03-16 20:23:47,429 INFO L226 Difference]: Without dead ends: 1061 [2025-03-16 20:23:47,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:23:47,430 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 6246 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6246 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:47,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6246 Valid, 2171 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:23:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-16 20:23:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 849. [2025-03-16 20:23:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.859504132231405) internal successors, (1575), 848 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states 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:23:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1575 transitions. [2025-03-16 20:23:47,447 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1575 transitions. Word has length 41 [2025-03-16 20:23:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:47,447 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1575 transitions. [2025-03-16 20:23:47,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:23:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1575 transitions. [2025-03-16 20:23:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:23:47,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:47,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:47,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:23:47,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:47,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash -589844957, now seen corresponding path program 1 times [2025-03-16 20:23:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:47,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040445378] [2025-03-16 20:23:47,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:47,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:23:47,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:23:47,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:47,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:47,677 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:23:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:47,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040445378] [2025-03-16 20:23:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040445378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:47,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271504228] [2025-03-16 20:23:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:47,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:47,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:47,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:47,678 INFO L87 Difference]: Start difference. First operand 849 states and 1575 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:23:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:47,770 INFO L93 Difference]: Finished difference Result 919 states and 1685 transitions. [2025-03-16 20:23:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:23:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:47,777 INFO L225 Difference]: With dead ends: 919 [2025-03-16 20:23:47,777 INFO L226 Difference]: Without dead ends: 851 [2025-03-16 20:23:47,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:23:47,779 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 5916 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5916 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:47,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5916 Valid, 1672 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-16 20:23:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2025-03-16 20:23:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.858323494687131) internal successors, (1574), 848 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states 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:23:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1574 transitions. [2025-03-16 20:23:47,799 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1574 transitions. Word has length 43 [2025-03-16 20:23:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:47,800 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1574 transitions. [2025-03-16 20:23:47,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:23:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1574 transitions. [2025-03-16 20:23:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:23:47,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:47,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:47,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:23:47,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -590887642, now seen corresponding path program 1 times [2025-03-16 20:23:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431876748] [2025-03-16 20:23:47,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:47,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:23:47,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:23:47,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:47,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:47,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431876748] [2025-03-16 20:23:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431876748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:47,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027607378] [2025-03-16 20:23:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:47,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:47,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:47,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:47,873 INFO L87 Difference]: Start difference. First operand 849 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:23:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:47,892 INFO L93 Difference]: Finished difference Result 974 states and 1771 transitions. [2025-03-16 20:23:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:47,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:23:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:47,896 INFO L225 Difference]: With dead ends: 974 [2025-03-16 20:23:47,896 INFO L226 Difference]: Without dead ends: 906 [2025-03-16 20:23:47,896 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:23:47,897 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:47,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-16 20:23:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2025-03-16 20:23:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.8392461197339247) internal successors, (1659), 903 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states 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:23:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1659 transitions. [2025-03-16 20:23:47,913 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1659 transitions. Word has length 43 [2025-03-16 20:23:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:47,914 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1659 transitions. [2025-03-16 20:23:47,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:23:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1659 transitions. [2025-03-16 20:23:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:23:47,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:47,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:47,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:23:47,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:47,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1104339423, now seen corresponding path program 1 times [2025-03-16 20:23:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649833086] [2025-03-16 20:23:47,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:47,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:23:47,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:23:47,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:47,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,052 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:23:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649833086] [2025-03-16 20:23:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649833086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:23:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509185091] [2025-03-16 20:23:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:48,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:48,054 INFO L87 Difference]: Start difference. First operand 904 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:23:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:48,080 INFO L93 Difference]: Finished difference Result 910 states and 1666 transitions. [2025-03-16 20:23:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 20:23:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:48,083 INFO L225 Difference]: With dead ends: 910 [2025-03-16 20:23:48,083 INFO L226 Difference]: Without dead ends: 908 [2025-03-16 20:23:48,084 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:23:48,084 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 0 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:48,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-16 20:23:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-03-16 20:23:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 906 states have (on average 1.8344370860927153) internal successors, (1662), 907 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:23:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1662 transitions. [2025-03-16 20:23:48,098 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1662 transitions. Word has length 44 [2025-03-16 20:23:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:48,098 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1662 transitions. [2025-03-16 20:23:48,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:23:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1662 transitions. [2025-03-16 20:23:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:48,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:48,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:48,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:23:48,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:48,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash 937978053, now seen corresponding path program 1 times [2025-03-16 20:23:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692798174] [2025-03-16 20:23:48,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:48,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:48,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:48,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,141 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:23:48,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692798174] [2025-03-16 20:23:48,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692798174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:48,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834975366] [2025-03-16 20:23:48,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:48,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:48,142 INFO L87 Difference]: Start difference. First operand 908 states and 1662 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:48,160 INFO L93 Difference]: Finished difference Result 1046 states and 1875 transitions. [2025-03-16 20:23:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:48,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 45 [2025-03-16 20:23:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:48,163 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 20:23:48,164 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 20:23:48,165 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:23:48,166 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1484 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1620 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:23:48,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 20:23:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2025-03-16 20:23:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 970 states have (on average 1.81340206185567) internal successors, (1759), 971 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states 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:23:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1759 transitions. [2025-03-16 20:23:48,185 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1759 transitions. Word has length 45 [2025-03-16 20:23:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:48,185 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1759 transitions. [2025-03-16 20:23:48,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1759 transitions. [2025-03-16 20:23:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:48,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:48,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:23:48,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1695018693, now seen corresponding path program 1 times [2025-03-16 20:23:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466386663] [2025-03-16 20:23:48,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:48,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,241 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:23:48,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466386663] [2025-03-16 20:23:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466386663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593713516] [2025-03-16 20:23:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:48,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:48,242 INFO L87 Difference]: Start difference. First operand 972 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:48,262 INFO L93 Difference]: Finished difference Result 1326 states and 2299 transitions. [2025-03-16 20:23:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 45 [2025-03-16 20:23:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:48,266 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 20:23:48,267 INFO L226 Difference]: Without dead ends: 1137 [2025-03-16 20:23:48,267 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:23:48,267 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1620 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:23:48,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-16 20:23:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-03-16 20:23:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.766107678729038) internal successors, (2001), 1134 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states 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:23:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2001 transitions. [2025-03-16 20:23:48,287 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2001 transitions. Word has length 45 [2025-03-16 20:23:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:48,287 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 2001 transitions. [2025-03-16 20:23:48,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2001 transitions. [2025-03-16 20:23:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:48,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:48,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:48,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:23:48,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1145229765, now seen corresponding path program 1 times [2025-03-16 20:23:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:48,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406493094] [2025-03-16 20:23:48,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:48,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:48,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,339 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:23:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406493094] [2025-03-16 20:23:48,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406493094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:48,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:48,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:48,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467695202] [2025-03-16 20:23:48,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:48,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:48,340 INFO L87 Difference]: Start difference. First operand 1135 states and 2001 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:48,363 INFO L93 Difference]: Finished difference Result 1791 states and 2983 transitions. [2025-03-16 20:23:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:48,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 45 [2025-03-16 20:23:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:48,369 INFO L225 Difference]: With dead ends: 1791 [2025-03-16 20:23:48,369 INFO L226 Difference]: Without dead ends: 1439 [2025-03-16 20:23:48,370 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:23:48,372 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 1478 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1622 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:23:48,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1622 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-16 20:23:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2025-03-16 20:23:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1435 states have (on average 1.6982578397212544) internal successors, (2437), 1436 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states 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:23:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2437 transitions. [2025-03-16 20:23:48,397 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2437 transitions. Word has length 45 [2025-03-16 20:23:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:48,397 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2437 transitions. [2025-03-16 20:23:48,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2437 transitions. [2025-03-16 20:23:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:48,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:48,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:48,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:23:48,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:48,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:48,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1761201093, now seen corresponding path program 1 times [2025-03-16 20:23:48,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026486018] [2025-03-16 20:23:48,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:48,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:48,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:48,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,452 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:23:48,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026486018] [2025-03-16 20:23:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026486018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:48,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127703180] [2025-03-16 20:23:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:48,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:48,454 INFO L87 Difference]: Start difference. First operand 1437 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:48,482 INFO L93 Difference]: Finished difference Result 2649 states and 4207 transitions. [2025-03-16 20:23:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 45 [2025-03-16 20:23:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:48,488 INFO L225 Difference]: With dead ends: 2649 [2025-03-16 20:23:48,488 INFO L226 Difference]: Without dead ends: 1995 [2025-03-16 20:23:48,491 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:23:48,492 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1626 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:23:48,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-16 20:23:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2025-03-16 20:23:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1991 states have (on average 1.6137619286790557) internal successors, (3213), 1992 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states 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:23:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3213 transitions. [2025-03-16 20:23:48,531 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3213 transitions. Word has length 45 [2025-03-16 20:23:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:48,532 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 3213 transitions. [2025-03-16 20:23:48,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:23:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3213 transitions. [2025-03-16 20:23:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:23:48,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:48,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:23:48,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -74011704, now seen corresponding path program 1 times [2025-03-16 20:23:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854851907] [2025-03-16 20:23:48,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:48,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:23:48,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:23:48,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,595 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:23:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854851907] [2025-03-16 20:23:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854851907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:48,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:48,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:23:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127944652] [2025-03-16 20:23:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:48,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:48,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:48,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:48,597 INFO L87 Difference]: Start difference. First operand 1993 states and 3213 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:51,063 INFO L93 Difference]: Finished difference Result 3497 states and 6086 transitions. [2025-03-16 20:23:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:51,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 20:23:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:51,071 INFO L225 Difference]: With dead ends: 3497 [2025-03-16 20:23:51,071 INFO L226 Difference]: Without dead ends: 2744 [2025-03-16 20:23:51,072 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:23:51,073 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 824 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:51,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 558 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 20:23:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2025-03-16 20:23:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2744. [2025-03-16 20:23:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 2742 states have (on average 1.5288110867979576) internal successors, (4192), 2743 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states 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:23:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 4192 transitions. [2025-03-16 20:23:51,119 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 4192 transitions. Word has length 60 [2025-03-16 20:23:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:51,119 INFO L471 AbstractCegarLoop]: Abstraction has 2744 states and 4192 transitions. [2025-03-16 20:23:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 4192 transitions. [2025-03-16 20:23:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:51,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:51,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:23:51,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1434916046, now seen corresponding path program 1 times [2025-03-16 20:23:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376089010] [2025-03-16 20:23:51,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:51,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:51,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:51,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:51,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:23:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376089010] [2025-03-16 20:23:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376089010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:51,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130122333] [2025-03-16 20:23:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:51,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:51,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:51,218 INFO L87 Difference]: Start difference. First operand 2744 states and 4192 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:51,326 INFO L93 Difference]: Finished difference Result 7506 states and 11053 transitions. [2025-03-16 20:23:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:51,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:51,342 INFO L225 Difference]: With dead ends: 7506 [2025-03-16 20:23:51,342 INFO L226 Difference]: Without dead ends: 6640 [2025-03-16 20:23:51,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:51,346 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4637 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:51,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3294 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2025-03-16 20:23:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 3784. [2025-03-16 20:23:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 3782 states have (on average 1.4997355896351137) internal successors, (5672), 3783 states have internal predecessors, (5672), 0 states have call successors, (0), 0 states 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:23:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5672 transitions. [2025-03-16 20:23:51,462 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5672 transitions. Word has length 61 [2025-03-16 20:23:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:51,462 INFO L471 AbstractCegarLoop]: Abstraction has 3784 states and 5672 transitions. [2025-03-16 20:23:51,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5672 transitions. [2025-03-16 20:23:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:51,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:51,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:51,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:23:51,466 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:51,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash -677875406, now seen corresponding path program 1 times [2025-03-16 20:23:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9781392] [2025-03-16 20:23:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:51,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:51,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:51,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:23:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9781392] [2025-03-16 20:23:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9781392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702469646] [2025-03-16 20:23:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:51,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:51,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:51,564 INFO L87 Difference]: Start difference. First operand 3784 states and 5672 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:51,686 INFO L93 Difference]: Finished difference Result 8714 states and 12781 transitions. [2025-03-16 20:23:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:51,707 INFO L225 Difference]: With dead ends: 8714 [2025-03-16 20:23:51,707 INFO L226 Difference]: Without dead ends: 7504 [2025-03-16 20:23:51,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:51,711 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4672 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:51,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 3313 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2025-03-16 20:23:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 5424. [2025-03-16 20:23:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5424 states, 5422 states have (on average 1.4754703061600885) internal successors, (8000), 5423 states have internal predecessors, (8000), 0 states have call successors, (0), 0 states 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:23:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 8000 transitions. [2025-03-16 20:23:51,815 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 8000 transitions. Word has length 61 [2025-03-16 20:23:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:51,815 INFO L471 AbstractCegarLoop]: Abstraction has 5424 states and 8000 transitions. [2025-03-16 20:23:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 8000 transitions. [2025-03-16 20:23:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:51,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:51,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:23:51,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1227664334, now seen corresponding path program 1 times [2025-03-16 20:23:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049227933] [2025-03-16 20:23:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:51,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:51,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:51,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:51,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:23:51,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:51,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049227933] [2025-03-16 20:23:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049227933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:51,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:51,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568081098] [2025-03-16 20:23:51,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:51,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:51,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:51,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:51,905 INFO L87 Difference]: Start difference. First operand 5424 states and 8000 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:23:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:52,043 INFO L93 Difference]: Finished difference Result 9922 states and 14501 transitions. [2025-03-16 20:23:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:52,061 INFO L225 Difference]: With dead ends: 9922 [2025-03-16 20:23:52,062 INFO L226 Difference]: Without dead ends: 8712 [2025-03-16 20:23:52,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:52,066 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4667 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:52,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3328 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2025-03-16 20:23:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 6632. [2025-03-16 20:23:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6632 states, 6630 states have (on average 1.4660633484162895) internal successors, (9720), 6631 states have internal predecessors, (9720), 0 states have call successors, (0), 0 states 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:23:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 9720 transitions. [2025-03-16 20:23:52,183 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 9720 transitions. Word has length 61 [2025-03-16 20:23:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:52,183 INFO L471 AbstractCegarLoop]: Abstraction has 6632 states and 9720 transitions. [2025-03-16 20:23:52,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:23:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 9720 transitions. [2025-03-16 20:23:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:52,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:52,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:52,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:23:52,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash -611693006, now seen corresponding path program 1 times [2025-03-16 20:23:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:52,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473082109] [2025-03-16 20:23:52,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:52,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:52,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:52,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:52,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:23:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473082109] [2025-03-16 20:23:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473082109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327451724] [2025-03-16 20:23:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:52,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:52,303 INFO L87 Difference]: Start difference. First operand 6632 states and 9720 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:52,526 INFO L93 Difference]: Finished difference Result 11130 states and 16221 transitions. [2025-03-16 20:23:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:52,545 INFO L225 Difference]: With dead ends: 11130 [2025-03-16 20:23:52,545 INFO L226 Difference]: Without dead ends: 9920 [2025-03-16 20:23:52,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:52,550 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 4637 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:52,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3362 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:23:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9920 states. [2025-03-16 20:23:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9920 to 7840. [2025-03-16 20:23:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7840 states, 7838 states have (on average 1.459556009186017) internal successors, (11440), 7839 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states 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:23:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7840 states to 7840 states and 11440 transitions. [2025-03-16 20:23:52,695 INFO L78 Accepts]: Start accepts. Automaton has 7840 states and 11440 transitions. Word has length 61 [2025-03-16 20:23:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:52,695 INFO L471 AbstractCegarLoop]: Abstraction has 7840 states and 11440 transitions. [2025-03-16 20:23:52,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 7840 states and 11440 transitions. [2025-03-16 20:23:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:23:52,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:52,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:23:52,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 31261546, now seen corresponding path program 1 times [2025-03-16 20:23:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10468387] [2025-03-16 20:23:52,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:23:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:23:52,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:52,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10468387] [2025-03-16 20:23:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10468387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:52,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:52,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975252426] [2025-03-16 20:23:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:52,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:52,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:52,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:52,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:52,760 INFO L87 Difference]: Start difference. First operand 7840 states and 11440 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:23:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:52,833 INFO L93 Difference]: Finished difference Result 14148 states and 20434 transitions. [2025-03-16 20:23:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 20:23:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:52,846 INFO L225 Difference]: With dead ends: 14148 [2025-03-16 20:23:52,846 INFO L226 Difference]: Without dead ends: 7842 [2025-03-16 20:23:52,852 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:23:52,853 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 37 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 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:23:52,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7842 states. [2025-03-16 20:23:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7842 to 7840. [2025-03-16 20:23:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7840 states, 7838 states have (on average 1.443735646848686) internal successors, (11316), 7839 states have internal predecessors, (11316), 0 states have call successors, (0), 0 states 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:23:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7840 states to 7840 states and 11316 transitions. [2025-03-16 20:23:52,961 INFO L78 Accepts]: Start accepts. Automaton has 7840 states and 11316 transitions. Word has length 62 [2025-03-16 20:23:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:52,962 INFO L471 AbstractCegarLoop]: Abstraction has 7840 states and 11316 transitions. [2025-03-16 20:23:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:23:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7840 states and 11316 transitions. [2025-03-16 20:23:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:23:52,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:52,963 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:23:52,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:23:52,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 610722996, now seen corresponding path program 1 times [2025-03-16 20:23:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:52,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79240989] [2025-03-16 20:23:52,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:52,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:23:52,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:23:52,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:52,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79240989] [2025-03-16 20:23:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79240989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632143735] [2025-03-16 20:23:53,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:53,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:53,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:53,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:53,021 INFO L87 Difference]: Start difference. First operand 7840 states and 11316 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:53,094 INFO L93 Difference]: Finished difference Result 10236 states and 14723 transitions. [2025-03-16 20:23:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:53,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:23:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:53,101 INFO L225 Difference]: With dead ends: 10236 [2025-03-16 20:23:53,101 INFO L226 Difference]: Without dead ends: 3930 [2025-03-16 20:23:53,105 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:23:53,106 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 31 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3055 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:23:53,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3055 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2025-03-16 20:23:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3923. [2025-03-16 20:23:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3921 states have (on average 1.479979597041571) internal successors, (5803), 3922 states have internal predecessors, (5803), 0 states have call successors, (0), 0 states 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:23:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5803 transitions. [2025-03-16 20:23:53,151 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5803 transitions. Word has length 63 [2025-03-16 20:23:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:53,152 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 5803 transitions. [2025-03-16 20:23:53,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5803 transitions. [2025-03-16 20:23:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:23:53,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:53,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:53,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:23:53,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 106290851, now seen corresponding path program 1 times [2025-03-16 20:23:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088772573] [2025-03-16 20:23:53,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:53,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:23:53,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:23:53,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:53,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088772573] [2025-03-16 20:23:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088772573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:53,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901638660] [2025-03-16 20:23:53,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:53,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:53,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:53,209 INFO L87 Difference]: Start difference. First operand 3923 states and 5803 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:23:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:53,235 INFO L93 Difference]: Finished difference Result 5115 states and 7477 transitions. [2025-03-16 20:23:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 20:23:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:53,239 INFO L225 Difference]: With dead ends: 5115 [2025-03-16 20:23:53,239 INFO L226 Difference]: Without dead ends: 2737 [2025-03-16 20:23:53,241 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:23:53,241 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 33 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3034 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:23:53,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2025-03-16 20:23:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2735. [2025-03-16 20:23:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2733 states have (on average 1.5034760336626418) internal successors, (4109), 2734 states have internal predecessors, (4109), 0 states have call successors, (0), 0 states 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:23:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4109 transitions. [2025-03-16 20:23:53,270 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4109 transitions. Word has length 64 [2025-03-16 20:23:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:53,270 INFO L471 AbstractCegarLoop]: Abstraction has 2735 states and 4109 transitions. [2025-03-16 20:23:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:23:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4109 transitions. [2025-03-16 20:23:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:23:53,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:53,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:53,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:23:53,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:53,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1930173660, now seen corresponding path program 1 times [2025-03-16 20:23:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049233913] [2025-03-16 20:23:53,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:53,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:23:53,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:23:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049233913] [2025-03-16 20:23:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049233913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874270377] [2025-03-16 20:23:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:53,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:53,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:53,329 INFO L87 Difference]: Start difference. First operand 2735 states and 4109 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:23:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:53,348 INFO L93 Difference]: Finished difference Result 3333 states and 4936 transitions. [2025-03-16 20:23:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:23:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:53,351 INFO L225 Difference]: With dead ends: 3333 [2025-03-16 20:23:53,352 INFO L226 Difference]: Without dead ends: 2143 [2025-03-16 20:23:53,353 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:23:53,353 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 30 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:53,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2025-03-16 20:23:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2141. [2025-03-16 20:23:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2139 states have (on average 1.5301542776998598) internal successors, (3273), 2140 states have internal predecessors, (3273), 0 states have call successors, (0), 0 states 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:23:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3273 transitions. [2025-03-16 20:23:53,373 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3273 transitions. Word has length 66 [2025-03-16 20:23:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:53,374 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 3273 transitions. [2025-03-16 20:23:53,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:23:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3273 transitions. [2025-03-16 20:23:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:23:53,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:53,375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:53,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:23:53,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 103108117, now seen corresponding path program 1 times [2025-03-16 20:23:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410732729] [2025-03-16 20:23:53,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:53,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:23:53,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:23:53,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:53,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410732729] [2025-03-16 20:23:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410732729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043769679] [2025-03-16 20:23:54,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:54,347 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:23:54,349 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:23:54,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:23:54,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:23:54,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:54,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:54,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:23:54,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:54,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043769679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:55,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-03-16 20:23:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071939050] [2025-03-16 20:23:55,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 20:23:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:55,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 20:23:55,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-16 20:23:55,411 INFO L87 Difference]: Start difference. First operand 2141 states and 3273 transitions. Second operand has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 26 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:55,859 INFO L93 Difference]: Finished difference Result 3401 states and 5003 transitions. [2025-03-16 20:23:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 20:23:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 26 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:23:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:55,864 INFO L225 Difference]: With dead ends: 3401 [2025-03-16 20:23:55,864 INFO L226 Difference]: Without dead ends: 2805 [2025-03-16 20:23:55,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 20:23:55,866 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 19703 mSDsluCounter, 3240 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19703 SdHoareTripleChecker+Valid, 4735 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:55,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19703 Valid, 4735 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:23:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2025-03-16 20:23:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2779. [2025-03-16 20:23:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2777 states have (on average 1.4836154123154484) internal successors, (4120), 2778 states have internal predecessors, (4120), 0 states have call successors, (0), 0 states 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:23:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4120 transitions. [2025-03-16 20:23:55,936 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4120 transitions. Word has length 68 [2025-03-16 20:23:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:55,936 INFO L471 AbstractCegarLoop]: Abstraction has 2779 states and 4120 transitions. [2025-03-16 20:23:55,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 26 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4120 transitions. [2025-03-16 20:23:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:23:55,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:55,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:55,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:23:56,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:56,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -263141404, now seen corresponding path program 1 times [2025-03-16 20:23:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323162311] [2025-03-16 20:23:56,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:56,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:56,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:56,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:56,405 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:23:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323162311] [2025-03-16 20:23:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323162311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940165236] [2025-03-16 20:23:56,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:56,408 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:23:56,410 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:23:56,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:56,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:56,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:56,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:56,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:23:56,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:57,419 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:23:57,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:58,410 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:23:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940165236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:58,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:58,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2025-03-16 20:23:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762566509] [2025-03-16 20:23:58,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:58,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:23:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:58,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:23:58,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:23:58,412 INFO L87 Difference]: Start difference. First operand 2779 states and 4120 transitions. Second operand has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:23:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:59,413 INFO L93 Difference]: Finished difference Result 6707 states and 9417 transitions. [2025-03-16 20:23:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 20:23:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 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 69 [2025-03-16 20:23:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:59,420 INFO L225 Difference]: With dead ends: 6707 [2025-03-16 20:23:59,420 INFO L226 Difference]: Without dead ends: 5473 [2025-03-16 20:23:59,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=698, Invalid=2382, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 20:23:59,423 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 22935 mSDsluCounter, 6429 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22935 SdHoareTripleChecker+Valid, 7939 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:59,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22935 Valid, 7939 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:23:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2025-03-16 20:23:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 5331. [2025-03-16 20:23:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5329 states have (on average 1.4047663726778008) internal successors, (7486), 5330 states have internal predecessors, (7486), 0 states have call successors, (0), 0 states 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:23:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 7486 transitions. [2025-03-16 20:23:59,498 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 7486 transitions. Word has length 69 [2025-03-16 20:23:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:59,498 INFO L471 AbstractCegarLoop]: Abstraction has 5331 states and 7486 transitions. [2025-03-16 20:23:59,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:23:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 7486 transitions. [2025-03-16 20:23:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:23:59,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:59,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:59,506 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:23:59,700 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,SelfDestructingSolverStorable20 [2025-03-16 20:23:59,701 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:59,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1865900900, now seen corresponding path program 1 times [2025-03-16 20:23:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:59,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212931809] [2025-03-16 20:23:59,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:59,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:59,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:59,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:59,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:59,979 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:23:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212931809] [2025-03-16 20:23:59,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212931809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911177421] [2025-03-16 20:23:59,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:59,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:59,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:59,982 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:23:59,984 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:24:00,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:24:00,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:24:00,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:00,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:24:00,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:24:00,266 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:24:00,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:24:00,736 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:24:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911177421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:24:00,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:24:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:24:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61799720] [2025-03-16 20:24:00,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:24:00,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:24:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:00,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:24:00,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:24:00,737 INFO L87 Difference]: Start difference. First operand 5331 states and 7486 transitions. Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:24:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:01,088 INFO L93 Difference]: Finished difference Result 12905 states and 17543 transitions. [2025-03-16 20:24:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:24:01,091 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 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 69 [2025-03-16 20:24:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:01,101 INFO L225 Difference]: With dead ends: 12905 [2025-03-16 20:24:01,101 INFO L226 Difference]: Without dead ends: 9119 [2025-03-16 20:24:01,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:24:01,108 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 10640 mSDsluCounter, 4705 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10640 SdHoareTripleChecker+Valid, 6201 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:01,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10640 Valid, 6201 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:24:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9119 states. [2025-03-16 20:24:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9119 to 9115. [2025-03-16 20:24:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9115 states, 9113 states have (on average 1.3658509821134643) internal successors, (12447), 9114 states have internal predecessors, (12447), 0 states have call successors, (0), 0 states 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:24:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 12447 transitions. [2025-03-16 20:24:01,259 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 12447 transitions. Word has length 69 [2025-03-16 20:24:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:01,259 INFO L471 AbstractCegarLoop]: Abstraction has 9115 states and 12447 transitions. [2025-03-16 20:24:01,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:24:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 12447 transitions. [2025-03-16 20:24:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:24:01,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:01,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:24:01,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:24:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:24:01,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1906622144, now seen corresponding path program 1 times [2025-03-16 20:24:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364757298] [2025-03-16 20:24:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:24:01,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:24:01,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:01,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364757298] [2025-03-16 20:24:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364757298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:24:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17166882] [2025-03-16 20:24:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:24:01,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:24:01,670 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:24:01,672 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:24:01,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:24:01,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:24:01,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:01,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:01,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:24:01,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:24:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:02,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:24:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17166882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:24:02,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:24:02,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-16 20:24:02,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912205979] [2025-03-16 20:24:02,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:24:02,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:24:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:02,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:24:02,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:24:02,790 INFO L87 Difference]: Start difference. First operand 9115 states and 12447 transitions. Second operand has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:24:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:03,440 INFO L93 Difference]: Finished difference Result 25049 states and 33614 transitions. [2025-03-16 20:24:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 20:24:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 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 70 [2025-03-16 20:24:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:03,460 INFO L225 Difference]: With dead ends: 25049 [2025-03-16 20:24:03,460 INFO L226 Difference]: Without dead ends: 17479 [2025-03-16 20:24:03,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:24:03,470 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 13607 mSDsluCounter, 7792 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13607 SdHoareTripleChecker+Valid, 9292 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:03,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13607 Valid, 9292 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:24:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17479 states. [2025-03-16 20:24:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17479 to 17211. [2025-03-16 20:24:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17211 states, 17209 states have (on average 1.3266895229240514) internal successors, (22831), 17210 states have internal predecessors, (22831), 0 states have call successors, (0), 0 states 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:24:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17211 states to 17211 states and 22831 transitions. [2025-03-16 20:24:03,957 INFO L78 Accepts]: Start accepts. Automaton has 17211 states and 22831 transitions. Word has length 70 [2025-03-16 20:24:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:03,958 INFO L471 AbstractCegarLoop]: Abstraction has 17211 states and 22831 transitions. [2025-03-16 20:24:03,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:24:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17211 states and 22831 transitions. [2025-03-16 20:24:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:24:03,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:03,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:24:03,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:24:04,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:24:04,164 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 820241630, now seen corresponding path program 1 times [2025-03-16 20:24:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527776604] [2025-03-16 20:24:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:04,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:24:04,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:24:04,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:04,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527776604] [2025-03-16 20:24:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527776604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:24:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298952006] [2025-03-16 20:24:05,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:05,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:24:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:24:05,920 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:24:05,921 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:24:05,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:24:06,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:24:06,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:06,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:06,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 20:24:06,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:24:10,024 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:24:10,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:24:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298952006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:24:12,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:24:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 62 [2025-03-16 20:24:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564272489] [2025-03-16 20:24:12,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:24:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-16 20:24:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:12,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-16 20:24:12,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3435, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:24:12,699 INFO L87 Difference]: Start difference. First operand 17211 states and 22831 transitions. Second operand has 62 states, 62 states have (on average 3.129032258064516) internal successors, (194), 62 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)